Sciweavers

553 search results - page 3 / 111
» On Planar Path Transformation
Sort
View
GD
2006
Springer
13 years 11 months ago
Simultaneous Graph Embedding with Bends and Circular Arcs
Abstract. We consider the problem of simultaneous embedding of planar graphs. We demonstrate how to simultaneously embed a path and an n-level planar graph and how to use radial em...
Justin Cappos, Alejandro Estrella-Balderrama, J. J...
STOC
2003
ACM
108views Algorithms» more  STOC 2003»
14 years 7 months ago
Short path queries in planar graphs in constant time
Lukasz Kowalik, Maciej Kurowski
FCT
1995
Springer
13 years 11 months ago
Fast Algorithms for Maintaining Shortest Paths in Outerplanar and Planar Digraphs
Abstract. We present algorithms for maintaining shortest path information in dynamic outerplanar digraphs with sublogarithmic query time. By choosing appropriate parameters we achi...
Hristo Djidjev, Grammati E. Pantziou, Christos D. ...
ISAAC
1995
Springer
97views Algorithms» more  ISAAC 1995»
13 years 11 months ago
A Linear Time Algorithm For Finding Maximal Planar Subgraphs
Given an undirected graph G, the maximal planar subgraph problem is to determine a planar subgraph H of G such that no edge of G-H can be added to H without destroying planarity. P...
Wen-Lian Hsu