A new perspective on clustered planarity as a combinatorial embedding problem
From MaRDI portal
Publication:897898
DOI10.1016/J.TCS.2015.10.011zbMATH Open1331.68242arXiv1506.05673OpenAlexW1805816469MaRDI QIDQ897898FDOQ897898
Authors: Thomas Bläsius, Ignaz Rutter 
Publication date: 8 December 2015
Published in: Theoretical Computer Science (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1506.05673
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
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)
Cites Work
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- Simultaneous PQ-ordering with applications to constrained embedding problems
- On-line maintenance of triconnected components with SPQR-trees
- Hierarchical planarity testing algorithms
- Simpler algorithms for testing two-page book embedding of partitioned graphs
- On embedding a cycle in a plane graph
- Advances on Testing C-Planarity of Embedded Flat 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: Embedded Clustered Graphs with Two-Component Clusters
- Clustering Cycles into Cycles of Clusters
- Planarity for clustered graphs
- Title not available (Why is that?)
- 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
- Shrinking the search space for clustered planarity
Cited In (24)
- Clustered planarity = flat clustered planarity
- Planarity for clustered graphs
- Overlapping Cluster Planarity
- Planarity of Overlapping Clusterings Including Unions of Two Partitions
- Computing Maximum C-Planar Subgraphs
- Simultaneous orthogonal planarity
- Beyond level planarity
- Simultaneous embedding: edge orderings, relative positions, cutvertices
- Drawing clustered planar graphs on disk arrangements
- Hanani-Tutte for Radial Planarity II
- Beyond Clustered Planar Graphs
- Synchronized Planarity with Applications to Constrained Planarity Problems
- C-planarity testing of embedded clustered graphs with bounded dual carving-width
- Atomic Embeddability, Clustered Planarity, and Thickenability
- Clustered planarity with pipes
- A note on obstructions to clustered planarity
- Embedding graphs into embedded graphs
- A new perspective on clustered planarity as a combinatorial embedding problem
- Advances on testing C-planarity of embedded flat clustered graphs
- Parameterized complexity of graph planarity with restricted cyclic orders
- Parameterized complexity of graph planarity with restricted cyclic orders
- Atomic embeddability, clustered planarity, and thickenability
- Planarity-preserving clustering and embedding for large planar graphs
- Title not available (Why is that?)
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)
