Practical Level Planarity Testing and Layout with Embedding Constraints
From MaRDI portal
Publication:5452211
Recommendations
Cites work
- A linear algorithm for embedding planar graphs using PQ-trees
- A satisfiability formulation of problems on level graphs
- Algorithms for multi-level graph planarity testing and layout
- Hierarchies and planarity theory
- Level Planar Embedding in Linear Time
- Planarity Testing and Optimal Edge Insertion with Embedding Constraints
Cited in
(10)- Graph Simultaneous Embedding Tool, GraphSET
- scientific article; zbMATH DE number 1377359 (Why is no real title available?)
- 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
- scientific article; zbMATH DE number 1930928 (Why is no real title available?)
- Partial and Constrained Level Planarity
- Level-planarity: transitivity vs. even crossings
- Constrained planarity in practice: engineering the synchronized planarity algorithm
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)