47 search results - page 9 / 10 » How to draw the minimum cuts of a planar graph |
IWPEC
2009
Springer
14 years 4 months ago
2009
Springer
Abstract. We introduce the graph parameter boolean-width, related to the number of different unions of neighborhoods across a cut of a graph. For many graph problems this number is...
CORR
2011
Springer
13 years 1 months ago
2011
Springer
We present an approximation scheme for optimizing certain Quadratic Integer Programming problems with positive semidefinite objective functions and global linear constraints. Thi...
CVPR
2006
IEEE
14 years 11 months ago
2006
IEEE
This paper presents a new volumetric stereo algorithm to reconstruct the 3D shape of an arbitrary object. Our method is based on finding the minimum cut in an octahedral graph str...
COMGEO
2006
ACM
13 years 9 months ago
2006
ACM
Geometric shortest paths are a major topic in computational geometry; see the survey paper by Mitchell [12]. A shortest path between two points in a simple polygon can be found in...
CVPR
2008
IEEE
14 years 11 months ago
2008
IEEE
Accurate estimation of optical flow is a challenging task, which often requires addressing difficult energy optimization problems. To solve them, most top-performing methods rely ...