Straight-Line Rectangular Drawings of Clustered Graphs
From MaRDI portal
Publication:3183438
DOI10.1007/978-3-642-03367-4_3zbMath1253.68326OpenAlexW1961955619MaRDI QIDQ3183438
Fabrizio Frati, Michael Kaufmann, Patrizio Angelini
Publication date: 20 October 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-03367-4_3
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph representations (geometric and intersection representations, etc.) (05C62)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Straight-line rectangular drawings of clustered graphs
- Drawing \(c\)-planar biconnected clustered graphs
- Completely connected clustered graphs
- Straight-line drawing algorithms for hierarchical graphs and clustered graphs
- How to Draw a Clustered Tree
- Drawing Clustered Graphs on an Orthogonal Grid
- C-Planarity of C-Connected Clustered Graphs
- Clustered Planarity: Small Clusters in Eulerian Graphs
- Graph Drawing