1822 search results - page 46 / 365 » The Method of Assigning Incidences |
ESA
2004
Springer
14 years 3 months ago
2004
Springer
For planar graphs, counting the number of perfect matchings (and hence determining whether there exists a perfect matching) can be done in NC [4, 10]. For planar bipartite graphs, ...
DM
2008
13 years 10 months ago
2008
A (p, 1)-total labelling of a graph G is an assignment of integers to V (G) E(G) such that: (i) any two adjacent vertices of G receive distinct integers, (ii) any two adjacent ed...
SIAMDM
2008
13 years 9 months ago
2008
Given a graph G = (V, E) with node weights v N {0}, v V , and some number F N{0}, the convex hull of the incidence vectors of all cuts (S), S V with (S) F and (V \ S) F is ...
IJCSA
2006
13 years 10 months ago
2006
The hybrid system of personalized product recommendation in e-commerce, by integrating various methods, was presented in the paper. Each e-commerce user has assigned their own wei...
CP
2004
Springer
14 years 3 months ago
2004
Springer
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve planning and scheduling problems. Tasks are allocated to facilities using MILP and sche...