6740 search results - page 44 / 1348 » An s -Hamiltonian Line Graph Problem |
STACS
2010
Springer
14 years 2 months ago
2010
Springer
Testing whether there is an induced path in a graph spanning k given vertices is already NP-complete in general graphs when k = 3. We show how to solve this problem in polynomial t...
COCO
2006
Springer
13 years 11 months ago
2006
Springer
We study the complexity of restricted versions of s-t-connectivity, which is the standard complete problem for NL. In particular, we focus on different classes of planar graphs, o...
CCCG
2007
13 years 9 months ago
2007
The empty space around n disjoint line segments in the plane can be partitioned into n + 1 convex faces by extending the segments in some order. The dual graph of such a partition...
SODA
2008
ACM
13 years 9 months ago
2008
ACM
ICCV
2007
IEEE
14 years 9 months ago
2007
IEEE
3D object reconstruction from a single 2D line drawing is an important problem in both computer vision and graphics. Many methods have been put forward to solve this problem, but ...