Simultaneous FPQ-ordering and hybrid planarity testing
نویسندگان
چکیده
We introduce and study a constrained planarity testing problem, called 1-Fixed Constrained Planarity, prove that this problem can be solved in quadratic time for biconnected graphs. Our solution is based on novel definition of fixedness makes it possible to simplify extend known techniques about Simultaneous PQ-Ordering. exploit result different versions the hybrid problem. Namely, we show polynomial-time solutions variant NodeTrix Planarity with fixed sides, PolyLink Clique sides.
منابع مشابه
Testing Cyclic Level and Simultaneous Level Planarity
In this paper we prove that testing the cyclic level planarity of a cyclic level graph is a polynomial-time solvable problem. This is achieved by introducing and studying a generalization of this problem, which we call cyclic T -level planarity. Moreover, we show a complexity dichotomy for testing the simultaneous level planarity of a set of level graphs, with respect to both the number of leve...
متن کاملTesting Simultaneous Planarity When the Common Graph Is 2-Connected
Two planar graphs G1 and G2 sharing some vertices and edges are simultaneously planar if they have planar drawings such that a shared vertex [edge] is represented by the same point [curve] in both drawings. It is an open problem whether simultaneous planarity can be tested efficiently. We give a linear-time algorithm to test simultaneous planarity when the shared graph is 2-connected. Our algor...
متن کاملPlanarity Testing and Embedding
Universita’ di Roma Tre 3.1 Properties and Characterizations of Planar Graphs . . . . . 2 Basic Definitions • Properties • Characterizations 3.2 Planarity Problems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 3.3 History of Planarity Algorithms. . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 3.4 Common Algorithmic Techniques and Tools . . . . . ...
متن کاملSimultaneous Orthogonal Planarity
We introduce and study the OrthoSEFE-k problem: Given k 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...
متن کاملTrack Planarity Testing and Embedding
A track graph is a graph with its vertex set partitioned into horizontal levels. It is track planar if there are permutations of the vertices on each level such that all edges can be drawn as weak monotone curves without crossings. The novelty and generalisation over level planar graphs is that horizontal edges connecting consecutive vertices on the same level are allowed. We show that track pl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2021
ISSN: ['1879-2294', '0304-3975']
DOI: https://doi.org/10.1016/j.tcs.2021.05.012