106 search results - page 15 / 22 » Manhattan-Geodesic Embedding of Planar Graphs |
ISAAC
2003
Springer
14 years 3 months ago
2003
Springer
Let G be an embedded planar graph whose edges may be curves. For two arbitrary points of G, we can compare the length of the shortest path in G connecting them against their Euclid...
PERCOM
2006
ACM
14 years 9 months ago
2006
ACM
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 ...
GD
2009
Springer
14 years 2 months ago
2009
Springer
Recently, we have presented a new practical method for upward crossing minimization [4], which clearly outperformed existing approaches for drawing hierarchical graphs in that resp...
COMBINATORICS
2006
13 years 9 months ago
2006
We present a variation of James Propp's generalized domino shuffling, which provides an efficient way to obtain perfect matchings of weighted Aztec diamonds. Our modification...
WADS
2001
Springer
14 years 2 months ago
2001
Springer
Even though a large number of I/O-efficient graph algorithms have been developed, a number of fundamental problems still remain open. For example, no space- and I/O-efficient algo...