Advances on testing C-planarity of embedded flat clustered graphs
DOI10.1142/S0129054119500011zbMATH Open1415.68156arXiv1408.2595OpenAlexW2921212541WikidataQ128295118 ScholiaQ128295118MaRDI QIDQ5384459FDOQ5384459
Authors: Markus Chimani, Giuseppe Di Battista, Fabrizio Frati, Karsten Klein 
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
Recommendations
Graph theory (including graph drawing) in computer science (68R10) Analysis of algorithms (68W40) Planar graphs; geometric and topological aspects of graph theory (05C10)
Cites Work
- Graph clustering
- On Embedding a Graph in the Grid with the Minimum Number of Bends
- On the computational complexity of upward and rectilinear planarity testing
- Upward drawings of triconnected digraphs.
- Testing Planarity of Partially Embedded Graphs
- Toward a theory of planarity: Hanani-Tutte and planarity variants
- Efficient \(C\)-planarity testing for embedded flat clustered graphs with small faces
- Clustered planarity: small clusters in cycles and Eulerian graphs
- Clustered Planarity: Embedded Clustered Graphs with Two-Component Clusters
- Clustering Cycles into Cycles of Clusters
- Planarity for clustered graphs
- Completely connected clustered graphs
- Clustered Planarity: Clusters with Few Outgoing Edges
- Title not available (Why is that?)
- Title not available (Why is that?)
- C-Planarity of C-Connected Clustered Graphs
- Graph Drawing
- Noncrossing Subgraphs in Topological Layouts
- A new perspective on clustered planarity as a combinatorial embedding problem
- Shrinking the search space for clustered planarity
- Computing Maximum C-Planar Subgraphs
- Relaxing the constraints of clustered planarity
- Splitting clusters to get c-planarity
- Overlapping Cluster Planarity
Cited In (7)
- Efficient C-Planarity Testing for Embedded Flat Clustered Graphs with Small Faces
- Efficient \(C\)-planarity testing for embedded flat clustered graphs with small faces
- Beyond Clustered Planar Graphs
- C-planarity testing of embedded clustered graphs with bounded dual carving-width
- Embedding graphs into embedded graphs
- A new perspective on clustered planarity as a combinatorial embedding problem
- Atomic embeddability, clustered planarity, and thickenability
This page was built for publication: Advances on testing C-planarity of embedded flat clustered graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5384459)
