6740 search results - page 294 / 1348 » An s -Hamiltonian Line Graph Problem |
162
click to vote
JDA
2006
15 years 5 months ago
2006
Assume that each vertex of a graph G is assigned a nonnegative integer weight and that l and u are nonnegative integers. One wishes to partition G into connected components by del...
143
click to vote
ISAAC
2009
Springer
15 years 9 months ago
2009
Springer
For a connected graph G = (V, E), a subset U ⊆ V is called a k-cut if U disconnects G, and the subgraph induced by U contains exactly k (≥ 1) components. More specifically, a ...
161
click to vote
STACS
1992
Springer
15 years 9 months ago
1992
Springer
We show that the graph isomorphism problem is low for PP and for C=P, i.e., it does not provide a PP or C=P computation with any additional power when used as an oracle. Furthermor...
163
click to vote
CVPR
2009
IEEE
17 years 7 days ago
2009
IEEE
We study the problem of generating plausible interpretations
of a scene from a collection of line segments automatically
extracted from a single indoor image. We show that
we ca...
128
click to vote
ICPR
2008
IEEE
16 years 6 months ago
2008
IEEE
We consider the problem of auto-calibration of cameras, which are fixed in location but are free to rotate while changing their internal parameters by zooming. Our method is based...