Sciweavers

Share
DM
2002

A polynomial time algorithm for determining zero Euler-Petrie genus of an Eulerian graph

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 graph. Dual-eulerian graphs were defined and studied in the context of silicon optimization of cmos layouts. They are necessarily of low connectivity with exponentially many planar embeddings. We give a polynomial time algorithm to answer the question whether or not a planar multigraph admits an embedding which is dual eulerian and constructs such an embedding, if it exists.
Brigitte Servatius, Herman Servatius
Added 18 Dec 2010
Updated 18 Dec 2010
Type Journal
Year 2002
Where DM
Authors Brigitte Servatius, Herman Servatius
Comments (0)
books