Advances on Testing C-Planarity of Embedded Flat Clustered Graphs
From MaRDI portal
Publication:5384459
DOI10.1142/S0129054119500011zbMath1415.68156arXiv1408.2595OpenAlexW2921212541WikidataQ128295118 ScholiaQ128295118MaRDI QIDQ5384459
Fabrizio Frati, Karsten Klein, Giuseppe Di Battista, Markus Chimani
Publication date: 24 June 2019
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1408.2595
Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Graph clustering
- A new perspective on clustered planarity as a combinatorial embedding problem
- Upward drawings of triconnected digraphs.
- Relaxing the constraints of clustered planarity
- Completely connected clustered graphs
- On the Computational Complexity of Upward and Rectilinear Planarity Testing
- Toward a Theory of Planarity: Hanani-Tutte and Planarity Variants
- Noncrossing Subgraphs in Topological Layouts
- Efficient C-Planarity Testing for Embedded Flat Clustered Graphs with Small Faces
- Clustered Planarity: Small Clusters in Cycles and Eulerian Graphs
- Splitting Clusters to Get C-Planarity
- Clustered Planarity: Clusters with Few Outgoing Edges
- Computing Maximum C-Planar Subgraphs
- Clustered Planarity: Embedded Clustered Graphs with Two-Component Clusters
- On Embedding a Graph in the Grid with the Minimum Number of Bends
- Shrinking the Search Space for Clustered Planarity
- Testing Planarity of Partially Embedded Graphs
- Clustering Cycles into Cycles of Clusters
- C-Planarity of C-Connected Clustered Graphs
- Overlapping Cluster Planarity
- Graph Drawing
- Planarity for clustered graphs
This page was built for publication: Advances on Testing C-Planarity of Embedded Flat Clustered Graphs
