How to draw a planar clustered graph

DOI10.1007/BFB0030816MaRDI QIDQ6064010zbMATH OpenFDO

Authors Qingwen Feng, R. F. Cohen, Peter Eades

Publication date 12 December 2023

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BFB0030816

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Drawing Clustered Graphs on an Orthogonal Grid
• Graph Drawing
• Straight-line rectangular drawings of clustered graphs
• Straight-Line Rectangular Drawings of Clustered Graphs
• Straight-line drawing algorithms for hierarchical graphs and clustered graphs

Cites work

• Algorithms for drawing graphs: An annotated bibliography
• Area requirement and symmetry display of planar upward drawings
• Drawing Graphs in the Plane with High Resolution
• Generalized Nested Dissection
• How to Draw a Graph
• scientific article; zbMATH DE number 43754 (Why is no real title available?)
• scientific article; zbMATH DE number 108553 (Why is no real title available?)
• scientific article; zbMATH DE number 1256645 (Why is no real title available?)
• On the Angular Resolution of Planar Graphs
• Planarity for clustered graphs

Cited in

(5)

• How to draw a clustered tree
• Towards the Hanani-Tutte theorem for clustered graphs
• Hanani-Tutte for approximating maps of graphs
• Crossing minimization in perturbed drawings
• Straight-line rectangular drawings of clustered graphs

This page was built for publication: How to draw a planar clustered graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6064010)