19 search results - page 1 / 4 » Long cycles in 3-cyclable graphs |
DM
2000
13 years 4 months ago
2000
DM
2010
13 years 4 months ago
2010
DM
2002
13 years 4 months ago
2002
ICCV
2007
IEEE
14 years 6 months ago
2007
IEEE
We introduce a novel topological formulation for contour grouping. Our grouping criterion, called untangling cycles, exploits the inherent topological 1D structure of salient cont...
WG
2004
Springer
13 years 10 months ago
2004
Springer
It has long been known that the number of spanning trees in circulant graphs with fixed jumps and n nodes satisfies a recurrence relation in n. The proof of this fact was algebra...