A new perspective on clustered planarity as a combinatorial embedding problem
From MaRDI portal
(Redirected from Publication:897898)
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)
Abstract: The clustered planarity problem (c-planarity) asks whether a hierarchically clustered graph admits a planar drawing such that the clusters can be nicely represented by regions. We introduce the cd-tree data structure and give a new characterization of c-planarity. It leads to efficient algorithms for c-planarity testing in the following cases. (i) Every cluster and every co-cluster (complement of a cluster) has at most two connected components. (ii) Every cluster has at most five outgoing edges. Moreover, the cd-tree reveals interesting connections between c-planarity and planarity with constraints on the order of edges around vertices. On one hand, this gives rise to a bunch of new open problems related to c-planarity, on the other hand it provides a new perspective on previous results.
Recommendations
- A new perspective on clustered planarity as a combinatorial embedding problem
- Clustered Planarity: Embedded Clustered Graphs with Two-Component Clusters
- scientific article; zbMATH DE number 26490
- A note on obstructions to clustered planarity
- Planarity for clustered graphs
- scientific article; zbMATH DE number 2084266
- Advances on Testing C-Planarity of Embedded Flat Clustered Graphs
- Shrinking the search space for clustered planarity
- Beyond Clustered Planar Graphs
- Advances on testing C-planarity of embedded flat clustered graphs
Cites work
- scientific article; zbMATH DE number 1189242 (Why is no real title available?)
- scientific article; zbMATH DE number 1262793 (Why is no real title available?)
- scientific article; zbMATH DE number 1974122 (Why is no real title available?)
- Advances on Testing C-Planarity of Embedded Flat Clustered Graphs
- C-Planarity of C-Connected Clustered Graphs
- Clustered Planarity: Clusters with Few Outgoing Edges
- Clustered Planarity: Embedded Clustered Graphs with Two-Component Clusters
- Clustered planarity: small clusters in cycles and Eulerian graphs
- Clustering Cycles into Cycles of Clusters
- Completely connected clustered graphs
- Efficient \(C\)-planarity testing for embedded flat clustered graphs with small faces
- Graph Drawing
- Hierarchical planarity testing algorithms
- On embedding a cycle in a plane graph
- On-line maintenance of triconnected components with SPQR-trees
- Planarity for clustered graphs
- Shrinking the search space for clustered planarity
- Simpler algorithms for testing two-page book embedding of partitioned graphs
- Simultaneous PQ-ordering with applications to constrained embedding problems
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
Cited in
(23)- Computing Maximum C-Planar Subgraphs
- Synchronized Planarity with Applications to Constrained Planarity Problems
- C-planarity testing of embedded clustered graphs with bounded dual carving-width
- Drawing clustered planar graphs on disk arrangements
- Advances on testing C-planarity of embedded flat clustered graphs
- Atomic Embeddability, Clustered Planarity, and Thickenability
- Simultaneous orthogonal planarity
- Clustered planarity = flat clustered planarity
- Clustered planarity with pipes
- Planarity-preserving clustering and embedding for large planar graphs
- Beyond Clustered Planar Graphs
- Hanani-Tutte for Radial Planarity II
- Overlapping Cluster Planarity
- Planarity for clustered graphs
- Atomic embeddability, clustered planarity, and thickenability
- Beyond level planarity
- Embedding graphs into embedded graphs
- A new perspective on clustered planarity as a combinatorial embedding problem
- Parameterized complexity of graph planarity with restricted cyclic orders
- Parameterized complexity of graph planarity with restricted cyclic orders
- A note on obstructions to clustered planarity
- Planarity of Overlapping Clusterings Including Unions of Two Partitions
- scientific article; zbMATH DE number 1500683 (Why is no real title available?)
This page was built for publication: A new perspective on clustered planarity as a combinatorial embedding problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q897898)
