Algorithms for multi-level graph planarity testing and layout
From MaRDI portal
Publication:596102
Recommendations
Cites work
- scientific article; zbMATH DE number 1696624 (Why is no real title available?)
- scientific article; zbMATH DE number 2123123 (Why is no real title available?)
- scientific article; zbMATH DE number 3963860 (Why is no real title available?)
- scientific article; zbMATH DE number 30296 (Why is no real title available?)
- scientific article; zbMATH DE number 1875438 (Why is no real title available?)
- Edge crossings in drawings of bipartite graphs
Cited in
(10)- Multi-circular Layout of Micro/Macro Graphs
- Cyclic Level Planarity Testing and Embedding
- An experimental evaluation of multilevel layout methods
- Multilevel planarity
- Multilevel planarity
- scientific article; zbMATH DE number 3871391 (Why is no real title available?)
- Crossing Minimization in Storyline Visualization
- Practical Level Planarity Testing and Layout with Embedding Constraints
- Linear Time Planarity Testing and Embedding of Strongly Connected Cyclic Level Graphs
- Multi-level verticality optimization: concept, strategies, and drawing scheme
This page was built for publication: Algorithms for multi-level graph planarity testing and layout
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q596102)