6740 search results - page 339 / 1348 » An s -Hamiltonian Line Graph Problem |
148
click to vote
ISAAC
2003
Springer
15 years 9 months ago
2003
Springer
The Satisfactory Partition problem consists in deciding if a given graph has a partition of its vertex set into two nonempty sets V1, V2 such that for each vertex v, if v ∈ Vi th...
131
click to vote
GD
2006
Springer
15 years 8 months ago
2006
Springer
We prove that computing a geometric minimum-dilation graph on a given set of points in the plane, using not more than a given number of edges, is an NP-hard problem, no matter if ...
124
click to vote
FOCS
1995
IEEE
15 years 8 months ago
1995
IEEE
We consider the special case of the traveling salesman problem TSP in which the distance metric is the shortest-path metric of a planar unweighted graph. We present a polynomial...
125
click to vote
STACS
1987
Springer
15 years 8 months ago
1987
Springer
It is shown that the graph isomorphism problem is located in the low hierarchy in NP. This implies that this problem is not NPcomplete (not even under weaker forms of polynomial-ti...
129
click to vote
DISOPT
2006
15 years 4 months ago
2006
We propose an effective heuristic to save memory in dynamic programming on tree decompositions when solving graph optimization problems. The introduced "anchor technique"...