Sciweavers

643 search results - page 24 / 129
» Supereulerian planar graphs
Sort
View
PERCOM
2006
ACM
14 years 7 months ago
Online Routing in Quasi-Planar and Quasi-Polyhedral Graphs
We address the problem of online route discovery for a class of graphs that can be embedded either in two or in three dimensional space. In two dimensions we propose the class of ...
Evangelos Kranakis, Tim Mott, Ladislav Stacho
GD
2009
Springer
14 years 7 days ago
Manhattan-Geodesic Embedding of Planar Graphs
In this paper, we explore a new convention for drawing graphs, the (Manhattan-) geodesic drawing convention. It requires that edges are drawn as interior-disjoint monotone chains o...
Bastian Katz, Marcus Krug, Ignaz Rutter, Alexander...
COMPGEOM
2006
ACM
14 years 1 months ago
Minimum weight triangulation is NP-hard
A triangulation of a planar point set S is a maximal plane straight-line graph with vertex set S. In the minimum weight triangulation (MWT) problem, we are looking for a triangula...
Wolfgang Mulzer, Günter Rote
STOC
2003
ACM
119views Algorithms» more  STOC 2003»
14 years 8 months ago
Constant factor approximation of vertex-cuts in planar graphs
Eyal Amir, Robert Krauthgamer, Satish Rao
STOC
2003
ACM
108views Algorithms» more  STOC 2003»
14 years 8 months ago
Short path queries in planar graphs in constant time
Lukasz Kowalik, Maciej Kurowski