How to draw a planar clustered graph
From MaRDI portal
Publication:6064010
DOI10.1007/bfb0030816zbMath1527.68160MaRDI QIDQ6064010
Qingwen Feng, R. F. Cohen, Peter Eades
Publication date: 12 December 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (4)
Towards the Hanani-Tutte Theorem for Clustered Graphs ⋮ Straight-line rectangular drawings of clustered graphs ⋮ Crossing minimization in perturbed drawings ⋮ Hanani-Tutte for approximating maps of graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Area requirement and symmetry display of planar upward drawings
- Algorithms for drawing graphs: An annotated bibliography
- Drawing Graphs in the Plane with High Resolution
- Generalized Nested Dissection
- On the Angular Resolution of Planar Graphs
- How to Draw a Graph
- Planarity for clustered graphs
This page was built for publication: How to draw a planar clustered graph