Straight-Line Rectangular Drawings of Clustered Graphs
From MaRDI portal
Recommendations
Cites work
- C-Planarity of C-Connected Clustered Graphs
- Clustered Planarity: Small Clusters in Eulerian Graphs
- Completely connected clustered graphs
- Drawing \(c\)-planar biconnected clustered graphs
- Drawing Clustered Graphs on an Orthogonal Grid
- Graph Drawing
- How to Draw a Clustered Tree
- scientific article; zbMATH DE number 1189242 (Why is no real title available?)
- scientific article; zbMATH DE number 1974122 (Why is no real title available?)
- scientific article; zbMATH DE number 3047038 (Why is no real title available?)
- Straight-line drawing algorithms for hierarchical graphs and clustered graphs
- Straight-line rectangular drawings of clustered graphs
Cited in
(12)- Straight-line drawing algorithms for hierarchical graphs and clustered graphs
- Multilevel drawings of clustered graphs
- Multilayer drawings of clustered graphs
- scientific article; zbMATH DE number 3924797 (Why is no real title available?)
- scientific article; zbMATH DE number 2079753 (Why is no real title available?)
- Drawing clustered graphs on disk arrangements
- Straightening Drawings of Clustered Hierarchical Graphs
- Graph Drawing
- Graph Drawing
- How to draw a planar clustered graph
- Straight-line rectangular drawings of clustered graphs
- Drawing \(c\)-planar biconnected clustered graphs
This page was built for publication: Straight-Line Rectangular Drawings of Clustered Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3183438)