Atomic Embeddability, Clustered Planarity, and Thickenability

07/30/2019
by   Radoslav Fulek, et al.
0

We study the atomic embeddability testing problem, which is a common generalization of clustered planarity (c-planarity, for short) and thickenability testing, and present a polynomial time algorithm for this problem, thereby giving the first polynomial time algorithm for c-planarity. C-planarity was introduced in 1995 by Feng, Cohen, and Eades as a variant of graph planarity, in which the vertex set of the input graph is endowed with a hierarchical clustering and we seek an embedding (crossing free drawing) of the graph in the plane that respects the clustering in a certain natural sense. Until now, it has been an open problem whether c-planarity can be tested efficiently, despite relentless efforts. The thickenability problem for simplicial complexes emerged in the topology of manifolds in the 1960s. A 2-dimensional simplicial complex is thickenable if it embeds in some orientable 3-dimensional manifold. Recently, Carmesin announced that thickenability can be tested in polynomial time. Our algorithm for atomic embeddability combines ideas from Carmesin's work with algorithmic tools previously developed for weak embeddability testing. We express our results purely in terms of graphs on surfaces, and rely on the machinery of topological graph theory. Finally we give a polynomial-time reduction from c-planarity to thickenability and show that a slight generalization of atomic embeddability to the setting in which clusters are toroidal graphs is NP-complete.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/09/2021

A Polynomial Time Algorithm for a NPC Problem

It is introduced a so called 'Multi-stage graph Simple Path' problem (MS...
research
07/28/2020

A polynomial-time algorithm to determine (almost) Hamiltonicity of dense regular graphs

We give a polynomial-time algorithm for detecting very long cycles in de...
research
03/19/2018

Embedding graphs into two-dimensional simplicial complexes

We consider the problem of deciding whether an input graph G admits a to...
research
03/13/2022

Short Topological Decompositions of Non-Orientable Surfaces

In this article, we investigate short topological decompositions of non-...
research
04/20/2019

Cluster Deletion on Interval Graphs and Split Related Graphs

In the Cluster Deletion problem the goal is to remove the minimum numbe...
research
12/11/2022

Beyond circular-arc graphs – recognizing lollipop graphs and medusa graphs

In 1992 Biró, Hujter and Tuza introduced, for every fixed connected grap...
research
08/22/2018

Clustered Planarity = Flat Clustered Planarity

The complexity of deciding whether a clustered graph admits a clustered ...

Please sign up or login with your details

Forgot password? Click here to reset