Practical Level Planarity Testing and Layout with Embedding Constraints

DOI10.1007/978-3-540-77537-9_9zbMath1137.68493OpenAlexW1852912860MaRDI QIDQ5452211

Patrick Healy, Martin Harrigan

Publication date: 25 March 2008

Published in: Graph Drawing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-77537-9_9

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (4)

Characterization of unlabeled level planar trees ⋮ Graph Simultaneous Embedding Tool, GraphSET ⋮ Multilevel Planarity ⋮ Level-planarity: transitivity vs. even crossings

Cites Work

• Unnamed Item
• Algorithms for multi-level graph planarity testing and layout
• A linear algorithm for embedding planar graphs using PQ-trees
• Planarity Testing and Optimal Edge Insertion with Embedding Constraints
• Hierarchies and planarity theory
• Level Planar Embedding in Linear Time

This page was built for publication: Practical Level Planarity Testing and Layout with Embedding Constraints