The Parameterized Complexity of Extending Stack Layouts

TL;DR

The results paint a detailed and surprisingly rich complexity-theoretic landscape of the problem which includes the identification of paraNP-hard, W[1]-hard and XP-tractable, as well as fixed-parameter tractable fragments of stack layout extension via a natural sequence of parameterizations.

Abstract

An $\ell$-page stack layout (also known as an $\ell$-page book embedding) of a graph is a linear order of the vertex set together with a partition of the edge set into $\ell$ stacks (or pages), such that the endpoints of no two edges on the same stack alternate. We study the problem of extending a given partial $\ell$-page stack layout into a complete one, which can be seen as a natural generalization of the classical NP-hard problem of computing a stack layout of an input graph from scratch. Given the inherent intractability of the problem, we focus on identifying tractable fragments through the refined lens of parameterized complexity analysis. Our results paint a detailed and surprisingly rich complexity-theoretic landscape of the problem which includes the identification of paraNP-hard, W[1]-hard and XP-tractable, as well as fixed-parameter tractable fragments of stack layout extension via a natural sequence of parameterizations.

Figures (2)

• Figure 1: (a) A graph $H$ and a two-page stack layout of it. In (b), the graph $H$ and its two-page stack layout are extended by the new vertices and edges marked in blue.
• Figure 2: The complexity landscape of Stack Layout Extension. VEDD denotes the vertex+edge deletion distance, $\omega$ denotes the page width of the $\ell$-page stack layout of $H$, and $\kappa = \left\vert V(G) \setminus V(H) \right\vert + \left\vert E(G)\setminus E(H) \right\vert$. Boxes outlined in bold represent new results that we show in the linked theorems and corollaries. The only result that is not depicted is Theorem \ref{['thm:only-edges-fpt']}.