Graph Planarity Testing with Hierarchical Embedding Constraints

04/29/2019
by   Giuseppe Liotta, et al.
0

Hierarchical embedding constraints define a set of allowed cyclic orders for the edges incident to the vertices of a graph. These constraints are expressed in terms of FPQ-trees. FPQ-trees are a variant of PQ-trees that includes F-nodes in addition to P- and to Q-nodes. An F-node represents a permutation that is fixed, i.e., it cannot be reversed. Let G be a graph such that every vertex of G is equipped with a set of FPQ-trees encoding hierarchical embedding constraints for its incident edges. We study the problem of testing whether G admits a planar embedding such that, for each vertex v of G, the cyclic order of the edges incident to v is described by at least one of the FPQ-trees associated with v. We prove that the problem is NP-complete even when the number of FPQ-trees associated with each vertex is bounded by a constant. If however the branchwidth of G is bounded, the problem can be solved in polynomial time. Besides being interesting on its own right, the study of planarity testing with hierarchical embedding constraints can be used to address other planarity testing problems which can be modeled by associating a set of FPQ-trees to the vertices of the input graph. As a proof of concept, we apply our techniques to the study of NodeTrix planarity testing of clustered graphs. We show that NodeTrix planarity testing with fixed sides is fixed-parameter tractable when parameterized by the size of the clusters and by the tree-width of the multi-graph obtained by collapsing the clusters to single vertices.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/23/2019

Parameterized Algorithms for Book Embedding Problems

A k-page book embedding of a graph G draws the vertices of G on a line a...
research
10/04/2019

C-Planarity Testing of Embedded Clustered Graphs with Bounded Dual Carving-Width

For a clustered graph, i.e, a graph whose vertex set is recursively part...
research
10/22/2019

Simultaneous FPQ-Ordering and Hybrid Planarity Testing

We study the interplay between embedding constrained planarity and hybri...
research
08/29/2023

Parameterized and Approximation Algorithms for the Maximum Bimodal Subgraph Problem

A vertex of a plane digraph is bimodal if all its incoming edges (and he...
research
02/27/2023

Contracting edges to destroy a pattern: A complexity study

Given a graph G and an integer k, the objective of the Π-Contraction pro...
research
03/14/2018

Subexponential-Time and FPT Algorithms for Embedded Flat Clustered Planarity

The C-Planarity problem asks for a drawing of a clustered graph, i.e., a...
research
07/30/2020

Synchronized Planarity with Applications to Constrained Planarity Problems

We introduce the problem Synchronized Planarity. Roughly speaking, its i...

Please sign up or login with your details

Forgot password? Click here to reset