643 search results - page 43 / 129 » Supereulerian planar graphs |
190
click to vote
MFCS
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. Bidimensionality provides a tool for developing subexponential fixed-parameter algorithms for combinatorial optimization problems on graph families that exclude a minor....
173
click to vote
GD
2007
Springer
16 years 13 days ago
2007
Springer
We consider the following problem known as simultaneous geometric graph embedding (SGE). Given a set of planar graphs on a shared vertex set, decide whether the vertices can be pla...
195
click to vote
LATIN
1995
Springer
15 years 9 months ago
1995
Springer
A linear-time algorithm for the minimum-ratio spanning tree problem on planar graphs is presented. The algorithm is based on a new planar minimum spanning tree algorithm. The appr...
172
click to vote
DCG
2010
15 years 6 months ago
2010
This paper shows that any planar graph with n vertices can be point-set embedded with at most one bend per edge on a universal set of n points in the plane. An implication of this...
180
click to vote
ALGORITHMICA
2008
15 years 6 months ago
2008
We show efficient algorithms for edge-coloring planar graphs. Our main result is a linear-time algorithm for coloring planar graphs with maximum degree with max{, 9} colors. Thus...