643 search results - page 76 / 129 » Supereulerian planar graphs |
168
click to vote
CCCG
2007
15 years 7 months ago
2007
We give an algorithm to morph between two planar drawings of a graph, preserving planarity, but allowing edges to bend during the course of the morph. The morph uses a polynomial ...
172
click to vote
CIAC
2006
Springer
15 years 10 months ago
2006
Springer
In this paper we construct two distributed algorithms for computing approximations of a largest matching and a minimum dominating set in planar graphs on n vertices. The approximat...
139
click to vote
JCT
2007
15 years 6 months ago
2007
Abstract. We prove that a binary matroid with huge branchwidth contains the cycle matroid of a large grid as a minor. This implies that an infinite antichain of binary matroids ca...
151
click to vote
APPROX
2007
Springer
15 years 10 months ago
2007
Springer
We show that the multi-commodity max-flow/min-cut gap for series-parallel graphs can be as bad as 2, matching a recent upper bound [8] for this class, and resolving one side of a ...
141
click to vote
IJISTA
2008
15 years 6 months ago
2008
: Planar patch detection aims at simplifying data from 3-D imaging sensors to a more compact scene description. We propose a fusion of intensity and depth information using Graph-C...