1,822 research outputs found

    A New Perspective on Clustered Planarity as a Combinatorial Embedding Problem

    Full text link
    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.Comment: 17 pages, 2 figure

    Simultaneous Embeddability of Two Partitions

    Full text link
    We study the simultaneous embeddability of a pair of partitions of the same underlying set into disjoint blocks. Each element of the set is mapped to a point in the plane and each block of either of the two partitions is mapped to a region that contains exactly those points that belong to the elements in the block and that is bounded by a simple closed curve. We establish three main classes of simultaneous embeddability (weak, strong, and full embeddability) that differ by increasingly strict well-formedness conditions on how different block regions are allowed to intersect. We show that these simultaneous embeddability classes are closely related to different planarity concepts of hypergraphs. For each embeddability class we give a full characterization. We show that (i) every pair of partitions has a weak simultaneous embedding, (ii) it is NP-complete to decide the existence of a strong simultaneous embedding, and (iii) the existence of a full simultaneous embedding can be tested in linear time.Comment: 17 pages, 7 figures, extended version of a paper to appear at GD 201

    Hierarchical Partial Planarity

    Full text link
    In this paper we consider graphs whose edges are associated with a degree of {\em importance}, which may depend on the type of connections they represent or on how recently they appeared in the scene, in a streaming setting. The goal is to construct layouts of these graphs in which the readability of an edge is proportional to its importance, that is, more important edges have fewer crossings. We formalize this problem and study the case in which there exist three different degrees of importance. We give a polynomial-time testing algorithm when the graph induced by the two most important sets of edges is biconnected. We also discuss interesting relationships with other constrained-planarity problems.Comment: Conference version appeared in WG201

    Planarity of Streamed Graphs

    Full text link
    In this paper we introduce a notion of planarity for graphs that are presented in a streaming fashion. A streamed graph\textit{streamed graph} is a stream of edges e1,e2,...,eme_1,e_2,...,e_m on a vertex set VV. A streamed graph is ω\omega-stream planar\textit{stream planar} with respect to a positive integer window size ω\omega if there exists a sequence of planar topological drawings Γi\Gamma_i of the graphs Gi=(V,{ejij<i+ω})G_i=(V,\{e_j \mid i\leq j < i+\omega\}) such that the common graph Gi=GiGi+1G^{i}_\cap=G_i\cap G_{i+1} is drawn the same in Γi\Gamma_i and in Γi+1\Gamma_{i+1}, for 1i<mω1\leq i < m-\omega. The Stream Planarity\textit{Stream Planarity} Problem with window size ω\omega asks whether a given streamed graph is ω\omega-stream planar. We also consider a generalization, where there is an additional backbone graph\textit{backbone graph} whose edges have to be present during each time step. These problems are related to several well-studied planarity problems. We show that the Stream Planarity\textit{Stream Planarity} Problem is NP-complete even when the window size is a constant and that the variant with a backbone graph is NP-complete for all ω2\omega \ge 2. On the positive side, we provide O(n+ωm)O(n+\omega{}m)-time algorithms for (i) the case ω=1\omega = 1 and (ii) all values of ω\omega provided the backbone graph consists of one 22-connected component plus isolated vertices and no stream edge connects two isolated vertices. Our results improve on the Hanani-Tutte-style O((nm)3)O((nm)^3)-time algorithm proposed by Schaefer [GD'14] for ω=1\omega=1.Comment: 21 pages, 9 figures, extended version of "Planarity of Streamed Graphs" (9th International Conference on Algorithms and Complexity, 2015

    Simultaneous Orthogonal Planarity

    Full text link
    We introduce and study the OrthoSEFEk\textit{OrthoSEFE}-k problem: Given kk planar graphs each with maximum degree 4 and the same vertex set, do they admit an OrthoSEFE, that is, is there an assignment of the vertices to grid points and of the edges to paths on the grid such that the same edges in distinct graphs are assigned the same path and such that the assignment induces a planar orthogonal drawing of each of the kk graphs? We show that the problem is NP-complete for k3k \geq 3 even if the shared graph is a Hamiltonian cycle and has sunflower intersection and for k2k \geq 2 even if the shared graph consists of a cycle and of isolated vertices. Whereas the problem is polynomial-time solvable for k=2k=2 when the union graph has maximum degree five and the shared graph is biconnected. Further, when the shared graph is biconnected and has sunflower intersection, we show that every positive instance has an OrthoSEFE with at most three bends per edge.Comment: Appears in the Proceedings of the 24th International Symposium on Graph Drawing and Network Visualization (GD 2016
    corecore