1,343 research outputs found

    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

    Strip Planarity Testing of Embedded Planar Graphs

    Get PDF
    In this paper we introduce and study the strip planarity testing problem, which takes as an input a planar graph G(V,E)G(V,E) and a function γ:V{1,2,,k}\gamma:V \rightarrow \{1,2,\dots,k\} and asks whether a planar drawing of GG exists such that each edge is monotone in the yy-direction and, for any u,vVu,v\in V with γ(u)<γ(v)\gamma(u)<\gamma(v), it holds y(u)<y(v)y(u)<y(v). The problem has strong relationships with some of the most deeply studied variants of the planarity testing problem, such as clustered planarity, upward planarity, and level planarity. We show that the problem is polynomial-time solvable if GG has a fixed planar embedding.Comment: 24 pages, 12 figures, extended version of 'Strip Planarity Testing' (21st International Symposium on Graph Drawing, 2013

    On the Recognition of Fan-Planar and Maximal Outer-Fan-Planar Graphs

    Full text link
    Fan-planar graphs were recently introduced as a generalization of 1-planar graphs. A graph is fan-planar if it can be embedded in the plane, such that each edge that is crossed more than once, is crossed by a bundle of two or more edges incident to a common vertex. A graph is outer-fan-planar if it has a fan-planar embedding in which every vertex is on the outer face. If, in addition, the insertion of an edge destroys its outer-fan-planarity, then it is maximal outer-fan-planar. In this paper, we present a polynomial-time algorithm to test whether a given graph is maximal outer-fan-planar. The algorithm can also be employed to produce an outer-fan-planar embedding, if one exists. On the negative side, we show that testing fan-planarity of a graph is NP-hard, for the case where the rotation system (i.e., the cyclic order of the edges around each vertex) is given

    Recognizing and Drawing IC-planar Graphs

    Full text link
    IC-planar graphs are those graphs that admit a drawing where no two crossed edges share an end-vertex and each edge is crossed at most once. They are a proper subfamily of the 1-planar graphs. Given an embedded IC-planar graph GG with nn vertices, we present an O(n)O(n)-time algorithm that computes a straight-line drawing of GG in quadratic area, and an O(n3)O(n^3)-time algorithm that computes a straight-line drawing of GG with right-angle crossings in exponential area. Both these area requirements are worst-case optimal. We also show that it is NP-complete to test IC-planarity both in the general case and in the case in which a rotation system is fixed for the input graph. Furthermore, we describe a polynomial-time algorithm to test whether a set of matching edges can be added to a triangulated planar graph such that the resulting graph is IC-planar

    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