310 search results - page 9 / 62 » Cutting two graphs simultaneously |
JCT
2006
13 years 9 months ago
2006
Thomassen conjectured that every 4-connected line graph is hamiltonian. A vertex cut X of G is essential if G-X has at least two nontrivial components. We prove that every 3-conne...
COMPGEOM
2009
ACM
14 years 3 months ago
2009
ACM
We describe the first algorithms to compute minimum cuts in surface-embedded graphs in near-linear time. Given an undirected graph embedded on an orientable surface of genus g, w...
ICMCS
2007
IEEE
14 years 3 months ago
2007
IEEE
Segmentation of video objects from background is a popular computer vision problem and has many important applications. Most existing methods are either computationally expensive ...
SIBGRAPI
2006
IEEE
14 years 3 months ago
2006
IEEE
This paper addresses the problem of foreground extraction using active illumination and graph-cut optimization. Our approach starts by detecting image regions that are likely to b...
COCOA
2007
Springer
14 years 3 months ago
2007
Springer
The Two-Sided Crossing Minimization (TSCM) problem calls for minimizing the number of edge crossings of a bipartite graph where the two sets of vertices are drawn on two parallel l...