686 search results - page 40 / 138 » Packing Cycles in Graphs |
96
Voted
JAIR
2012
13 years 2 months ago
2012
89
Voted
ICCV
2007
IEEE
16 years 2 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...
81
Voted
SIAMDM
2010
14 years 10 months ago
2010
We consider the class of max-min and min-max optimization problems subject to a global budget (or weight) constraint and we undertake a systematic algorithmic and complexitytheore...
COMPGEOM
2010
ACM
15 years 5 months ago
2010
ACM
Let G be an unweighted graph of complexity n cellularly embedded in a surface (orientable or not) of genus g. We describe improved algorithms to compute (the length of) a shortest...
94
Voted
DCG
2007
15 years 11 days ago
2007
Weprovethatthegenusoftheboundaryofadigitalimageispreciselyhalfofthe sum of the cycle ranks of three particular graphs: the “foreground graph” and “background graph,” which ...