Clustered Planarity with Pipes
نویسندگان
چکیده
We study the version of the C-PLANARITY problem in which edges connecting the same pair of clusters must be grouped into pipes, which generalizes the STRIP PLANARITY problem. We give algorithms to decide several families of instances for the two variants in which the order of the pipes around each cluster is given as part of the input or can be chosen by the algorithm.
منابع مشابه
Planarity Testing for C-Connected Clustered Graphs
We present a linear time algorithm for testing clustered planarity of c-connected clustered graphs and for computing a clustered planar embedding for such graphs. Our algorithm uses a decomposition of the input graph based on SPQR-trees and is the first linear time algorithm for clustered planarity testing. We define a normal form of clustered embeddings and show that a clustered graph is clust...
متن کاملClustered Planarity: Embedded Clustered Graphs with Two-Component Clusters
We present a polynomial-time algorithm for c-planarity testing of clustered graphs with fixed plane embedding and such that every cluster induces a subgraph with at most two connected components.
متن کاملClustered Graphs and C-planarity
In this paper, we introduce a new graph model known as clustered graphs, i.e. graphs with recursive clustering structures. This graph model has many applications in informational and mathematical sciences. In particular, we study C-planarity of clustered graphs. Given a clustered graph, the C-planarity testing problem is to determine whether the clustered graph can be drawn without edge crossin...
متن کاملClustered Level Planarity
Planarity is an important concept in graph drawing. It is generally accepted that planar drawings are well understandable. Recently, several variations of planarity have been studied for advanced graph concepts such as k-level graphs [6,10–16] and clustered graphs [5,7]. In k-level graphs, the vertices are partitioned into k levels and the vertices of one level are drawn on a horizontal line. I...
متن کاملShrinking the Search Space for Clustered Planarity
A clustered graph is a graph augmented with a hierarchical inclusion structure over its vertices, and arises very naturally in multiple application areas. While it is long known that planarity—i.e., drawability without edge crossings—of graphs can be tested in polynomial (linear) time, the complexity for the clustered case is still unknown. In this paper, we present a new graph theoretic reduct...
متن کامل