6740 search results - page 218 / 1348 » An s -Hamiltonian Line Graph Problem |
145
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
Constraint Satisfaction Problems (CSP) constitute a convenient way to capture many combinatorial problems. The general CSP is known to be NP-complete, but its complexity depends on...
237
click to vote
GD
2004
Springer
15 years 10 months ago
2004
Springer
We consider the following graph embedding question: given a graph G, is it possible to map its vertices to points in 3D such that G is isomorphic to the mutual nearest neighbor gra...
147
click to vote
GD
2003
Springer
15 years 10 months ago
2003
Springer
A three-dimensional grid drawing of a graph is a placement of the vertices at distinct points with integer coordinates, such that the straight line-segments representing the edges ...
134
click to vote
CP
2005
Springer
15 years 10 months ago
2005
Springer
Many problems of theoretical and practical interest can be formulated as Constraint Satisfaction Problems (CSPs). The general CSP is known to be NP-complete; however, distributed m...
129
click to vote
CSCLP
2005
Springer
15 years 10 months ago
2005
Springer
We discuss four variants of the graph colouring problem, and present algorithms for solving them. The problems are k-Colourability, Max Ind k-COL, Max Val k-COL, and, finally, Max...