Drawn Tree Decomposition: New Approach for Graph Drawing Problems

TL;DR

This paper introduces a novel geometric tree decomposition for graph drawings that enables efficient algorithms for problems like grid graph recognition and crossing minimization, overcoming limitations of traditional parameters.

Contribution

It proposes a new geometric tree decomposition for graph drawings, leading to XP algorithms for key graph drawing problems and establishing relations with existing width measures.

Findings

Developed a geometric tree decomposition scheme.

Achieved XP-time algorithms for multiple graph drawing problems.

Bounded the new parameter in certain drawing classes, enabling subexponential algorithms.

Abstract

Over the past decade, we witness an increasing amount of interest in the design of exact exponential-time and parameterized algorithms for problems in Graph Drawing. Unfortunately, we still lack knowledge of general methods to develop such algorithms. An even more serious issue is that, here, "standard" parameters very often yield intractability. In particular, for the most common structural parameter, namely, treewidth, we frequently observe NP-hardness already when the input graphs are restricted to have constant (often, being just $1$ or $2$) treewidth. Our work deals with both drawbacks simultaneously. We introduce a novel form of tree decomposition that, roughly speaking, does not decompose (only) a graph, but an entire drawing. As such, its bags and separators are of geometric (rather than only combinatorial) nature. While the corresponding parameter -- like treewidth -- can be arbitrarily smaller than the height (and width) of the drawing, we show that -- unlike treewidth -- it gives rise to efficient algorithms. Specifically, we get slice-wise polynomial (XP) time algorithms parameterized by our parameter. We present a general scheme for the design of such algorithms, and apply it to several central problems in Graph Drawing, including the recognition of grid graphs, minimization of crossings and bends, and compaction. Other than for the class of problems we discussed in the paper, we believe that our decomposition and scheme are of independent interest and can be further extended or generalized to suit even a wider class of problems. Additionally, we discuss classes of drawings where our parameter is bounded by $O(\sqrt{n})$ (where $n$ is the number of vertices of the graph), yielding subexponential-time algorithms. Lastly, we prove which relations exist between drawn treewidth and other width measures, including treewidth, pathwidth, (dual) carving-width and embedded-width.