Sciweavers

Share
7 search results - page 1 / 2
» Simultaneous Embedding of a Planar Graph and Its Dual on the...
Sort
View
CORR
2002
Springer
115views Education» more  CORR 2002»
8 years 9 months ago
Simultaneous Embedding of a Planar Graph and Its Dual on the Grid
Traditional representations of graphs and their duals suggest the requirement that the dual vertices should be placed inside their corresponding primal faces, and the edges of the ...
Cesim Erten, Stephen G. Kobourov
DM
2002
104views more  DM 2002»
8 years 9 months ago
A polynomial time algorithm for determining zero Euler-Petrie genus of an Eulerian graph
A dual-eulerian graph is a plane graph which has an ordering defined on its edge set which forms simultaneously an Euler circuit in the graph and an euler circuit in the dual grap...
Brigitte Servatius, Herman Servatius
COMGEO
2007
ACM
8 years 9 months ago
On simultaneous planar graph embeddings
We consider the problem of simultaneous embedding of planar graphs. There are two variants of this problem, one in which the mapping between the vertices of the two graphs is given...
Peter Braß, Eowyn Cenek, Christian A. Duncan...
GD
2004
Springer
9 years 2 months ago
Simultaneous Embedding of Planar Graphs with Few Bends
We present an O(n) time algorithm for simultaneous embedding of pairs of planar graphs on the O(n2 )×O(n2 ) grid, with at most three bends per edge, where n is the number of verti...
Cesim Erten, Stephen G. Kobourov
JGT
2007
85views more  JGT 2007»
8 years 9 months ago
On self duality of pathwidth in polyhedral graph embeddings
: Let G be a 3-connected planar graph and G∗ be its dual. We show that the pathwidth of G∗ is at most 6 times the pathwidth of G. We prove this result by relating the pathwidth...
Fedor V. Fomin, Dimitrios M. Thilikos
books