Sciweavers

1633 search results - page 56 / 327
» Planar Map Graphs
Sort
View
DM
2010
126views more  DM 2010»
13 years 10 months ago
Asymptotic connectivity of hyperbolic planar graphs
We investigate further the concept of asymptotic connectivity as defined previously by the first author. In particular, we compute an upper bound on the asymptotic connectivity of ...
Patrick Bahls, Michael R. Dipasquale
PERCOM
2006
ACM
14 years 9 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
JGT
2008
107views more  JGT 2008»
13 years 10 months ago
On planar intersection graphs with forbidden subgraphs
Let C be a family of n compact connected sets in the plane, whose intersection graph G(C) has no complete bipartite subgraph with k vertices in each of its classes. Then G(C) has ...
János Pach, Micha Sharir
GD
2009
Springer
14 years 2 months 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 4 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