Planarity

Radial Level Planarity Testing and Embedding in Linear Time

A graph with an ordered k-partition of the vertices is radial level planar if there is a strictly outward drawing on k concentric …

Christian Bachmaier, Franz J. Brandenburg, Michael Forster
PDF Cite
Radial Level Planarity Testing and Embedding in Linear Time
Track Planarity Testing and Embedding
A track graph is a graph with its vertex set partitioned into horizontal levels. It is track planar if there are permutations of the …
Christian Bachmaier, Franz J. Brandenburg, Michael Forster
PDF Cite Slides Slides (PDF)
Track Planarity Testing and Embedding
Radial Level Planarity Testing and Embedding in Linear Time
Every planar graph has a concentric representation based on a breadth first search, see [21]. The vertices are placed on concentric …
Christian Bachmaier, Franz J. Brandenburg, Michael Forster
PDF Cite Slides DOI Slides (PDF)
Radial Level Planarity Testing and Embedding in Linear Time
Clustered Level Planarity
Planarity is an important concept in graph drawing. It is generally accepted that planar drawings are well understandable. Recently, …
Michael Forster, Christian Bachmaier
PDF Cite Slides DOI Slides (PDF)
Clustered Level Planarity
Radial Level Planarity Testing and Embedding in Linear Time
Every planar graph has a concentric representation based on a breadth first search, see [24]. The vertices are placed on concentric …
Christian Bachmaier, Franz J. Brandenburg, Michael Forster
PDF Cite
Radial Level Planarity Testing and Embedding in Linear Time