Practical Level Planarity Testing and Layout with Embedding Constraints
DOI10.1007/978-3-540-77537-9_9zbMATH Open1137.68493OpenAlexW1852912860MaRDI QIDQ5452211FDOQ5452211
Authors: Martin Harrigan, Patrick Healy 
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
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph representations (geometric and intersection representations, etc.) (05C62)
Cites Work
- A linear algorithm for embedding planar graphs using PQ-trees
- Hierarchies and planarity theory
- Level Planar Embedding in Linear Time
- Algorithms for multi-level graph planarity testing and layout
- A satisfiability formulation of problems on level graphs
- Planarity Testing and Optimal Edge Insertion with Embedding Constraints
Cited In (10)
- Title not available (Why is that?)
- Multilevel planarity
- Algorithms for multi-level graph planarity testing and layout
- Characterization of unlabeled level planar trees
- Linear Time Planarity Testing and Embedding of Strongly Connected Cyclic Level Graphs
- Title not available (Why is that?)
- Partial and Constrained Level Planarity
- Constrained planarity in practice: engineering the synchronized planarity algorithm
- Level-planarity: transitivity vs. even crossings
- Graph Simultaneous Embedding Tool, GraphSET
This page was built for publication: Practical Level Planarity Testing and Layout with Embedding Constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5452211)
