Straight-line rectangular drawings of clustered graphs
From MaRDI portal
Publication:629827
DOI10.1007/s00454-010-9302-zzbMath1251.05110OpenAlexW2067829002MaRDI QIDQ629827
Fabrizio Frati, Michael Kaufmann, Patrizio Angelini
Publication date: 10 March 2011
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00454-010-9302-z
Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (5)
Straight-Line Rectangular Drawings of Clustered Graphs ⋮ Clustered planarity = flat clustered planarity ⋮ Strip planarity testing for embedded planar graphs ⋮ C-planarity testing of embedded clustered graphs with bounded dual carving-width ⋮ Drawing Clustered Planar Graphs on Disk Arrangements
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Drawing \(c\)-planar biconnected clustered graphs
- On embedding a cycle in a plane graph
- How to draw a clustered tree
- Algorithms for plane representations of acyclic digraphs
- Completely connected clustered graphs
- Straight-line drawing algorithms for hierarchical graphs and clustered graphs
- Efficient C-Planarity Testing for Embedded Flat Clustered Graphs with Small Faces
- Clustered Planarity: Small Clusters in Cycles and Eulerian Graphs
- Clustered Planarity: Clusters with Few Outgoing Edges
- Clustered Planarity: Embedded Clustered Graphs with Two-Component Clusters
- Non-convex Representations of Graphs
- Drawing Clustered Graphs on an Orthogonal Grid
- Clustering Cycles into Cycles of Clusters
- C-Planarity of C-Connected Clustered Graphs
- Graph Drawing
- Drawing graphs. Methods and models
- How to draw a planar clustered graph
- Planarity for clustered graphs
This page was built for publication: Straight-line rectangular drawings of clustered graphs
