53 search results - page 9 / 11 » Forcing a sparse minor |
FOCS
2008
IEEE
14 years 4 months ago
2008
IEEE
We study the properties of embeddings, multicommodity flows, and sparse cuts in minor-closed families of graphs which are also closed under 2-sums; this includes planar graphs, g...
FCT
2003
Springer
14 years 3 months ago
2003
Springer
The bandwidth minimization problem has a long history and a number of practical applications. In this paper we introduce a natural extension of bandwidth to partially ordered layo...
ICPR
2008
IEEE
14 years 11 months ago
2008
IEEE
Stereo algorithms for structure reconstruction demand accurate disparities with low mismatch errors and false positives. Mismatch errors in large textureless regions force most ac...
COMPGEOM
2005
ACM
13 years 11 months ago
2005
ACM
Star splaying is a general-dimensional algorithm that takes as input a triangulation or an approximation of a convex hull, and produces the Delaunay triangulation, weighted Delaun...
ICPR
2008
IEEE
13 years 11 months ago
2008
IEEE
Stereo algorithms for structure reconstruction demand accurate disparities with low mismatch errors
and false positives. Mismatch errors in large textureless regions force most a...