Log In Sign Up

Synchronized Planarity with Applications to Constrained Planarity Problems

by   Thomas Bläsius, et al.

We introduce the problem Synchronized Planarity. Roughly speaking, its input is a loop-free multi-graph together with synchronization constraints that, e.g., match pairs of vertices of equal degree by providing a bijection between their edges. Synchronized Planarity then asks whether the graph admits a crossing-free embedding into the plane such that the orders of edges around synchronized vertices are consistent. We show, on the one hand, that Synchronized Planarity can be solved in quadratic time, and, on the other hand, that it serves as a powerful modeling language that lets us easily formulate several constrained planarity problems as instances of Synchronized Planarity. In particular, this lets us solve Clustered Planarity in quadratic time, where the most efficient previously known algorithm has an upper bound of O(n^16).


page 1

page 2

page 3

page 4


On Fan-Crossing Graphs

A fan is a set of edges with a single common endpoint. A graph is fan-cr...

The number of small-degree vertices in matchstick graphs

A matchstick graph is a crossing-free unit-distance graph in the plane. ...

Bounding the number of edges of matchstick graphs

We show that a matchstick graph with n vertices has no more than 3n-c√(n...

Quasiplanar graphs, string graphs, and the Erdos-Gallai problem

An r-quasiplanar graph is a graph drawn in the plane with no r pairwise ...

Graph Planarity Testing with Hierarchical Embedding Constraints

Hierarchical embedding constraints define a set of allowed cyclic orders...

Shortcut Hulls: Vertex-restricted Outer Simplifications of Polygons

Let P be a crossing-free polygon and 𝒞 a set of shortcuts, where each sh...

A linear algorithm for Brick Wang tiling

The Wang tiling is a classical problem in combinatorics. A major theoret...