Clustered planarity = flat clustered planarity
From MaRDI portal
Publication:1725728
DOI10.1007/978-3-030-04414-5_2OpenAlexW2888759226MaRDI QIDQ1725728
Maurizio Patrignani, Pier Francesco Cortese
Publication date: 15 February 2019
Full work available at URL: https://arxiv.org/abs/1808.07437
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items
Synchronized Planarity with Applications to Constrained Planarity Problems, Clustered planarity = flat clustered planarity, C-planarity testing of embedded clustered graphs with bounded dual carving-width, Beyond Clustered Planar Graphs, Simultaneous Embedding
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph
- Strip planarity testing for embedded planar graphs
- Straight-line rectangular drawings of clustered graphs
- Clustered planarity testing revisited
- A new perspective on clustered planarity as a combinatorial embedding problem
- On embedding a cycle in a plane graph
- How to draw a clustered tree
- Subexponential-time and FPT algorithms for embedded flat clustered planarity
- \(c\)-planarity of embedded cyclic \(c\)-graphs
- Clustered planarity = flat clustered planarity
- Relaxing the constraints of clustered planarity
- NodeTrix planarity testing with small clusters
- Completely connected clustered graphs
- Straight-line drawing algorithms for hierarchical graphs and clustered graphs
- Toward a Theory of Planarity: Hanani-Tutte and Planarity Variants
- Strip Planarity Testing
- The Importance of Being Proper
- Advances on Testing C-Planarity of Embedded Flat Clustered Graphs
- Multilayer Drawings of Clustered Graphs
- Computing NodeTrix Representations of Clustered Graphs
- Efficient C-Planarity Testing for Embedded Flat Clustered Graphs with Small Faces
- Clustered Planarity: Small Clusters in Cycles and Eulerian Graphs
- Visual Analysis of One-To-Many Matched Graphs
- Splitting Clusters to Get C-Planarity
- Clustered Planarity: Clusters with Few Outgoing Edges
- Clustered Planarity: Embedded Clustered Graphs with Two-Component Clusters
- Drawing Clustered Graphs on an Orthogonal Grid
- Navigating Clustered Graphs Using Force-Directed Methods
- Clustered Planarity with Pipes
- Hanani-Tutte for approximating maps of graphs
- Embedding Graphs into Embedded Graphs
- Practical Experience with Hanani-Tutte for Testing c-Planarity
- Clustering Cycles into Cycles of Clusters
- C-Planarity of C-Connected Clustered Graphs
- Intersection-Link Representations of Graphs
- Graph Drawing
- Planarity for clustered graphs
