384 search results - page 24 / 77 » On s-hamiltonian-connected line graphs |
CVPR
2003
IEEE
14 years 1 months ago
2003
IEEE
We develop a framework for the image segmentation problem based on a new graph-theoretic formulation of clustering. The approach is motivated by the analogies between the intuitiv...
CVPR
2003
IEEE
14 years 10 months ago
2003
IEEE
The problem we study is; Given N views and a subset of the ??? ??? interview fundamental matrices, which of the other fundamental matrices can we compute using only the precompute...
MVA
1994
13 years 10 months ago
1994
This paper presents an efficient extraction method of closed loops as primitive symbols of line drawings, and an robust line drawing understanding system incorporating this extrac...
JGT
2008
13 years 8 months ago
2008
We prove that every simple cubic planar graph admits a planar embedding such that each edge is embedded as a straight line segment of integer length.
DM
2008
13 years 8 months ago
2008
A clique in a graph G is a complete subgraph of G. A clique covering (partition) of G is a collection C of cliques such that each edge of G occurs in at least (exactly) one clique...