Circle Planarity of Level Graphs

In this dissertation we generalise the notion of level planar graphs in two directions: track planarity and radial planarity. Our main results are linear time algorithms both for the planarity test and for the computation of an embedding, and thus a drawing. Our algorithms use and generalise PQ-trees, which are a data structure for efficient planarity tests.

Level thesis:degree_level

thesis.doctoral

Grantor dc:publisher

Universität Passau

Year

2004

Author dc:creator

• Bachmaier, Christian

Contributors dc:contributor

• Brandenburg, Franz J.

• radial level panarity
• track planarity

Statement dc:rights

• Standardbedingung laut Einverständniserklärung

Repository record source_url

https://opus4.kobv.de/opus4-uni-passau/frontdoor/index/index/docId/34

OAI identifier oai:identifier

oai:kobv.de-opus4-uni-passau:34