A new width parameter of graphs based on edge cuts: \alpha-edge-crossing width

DOI10.1007/978-3-031-43380-1_13MaRDI QIDQ6425938zbMATH OpenOpenAlexFDO

Authors Yeonsu Chang, O-joung Kwon, Myounghwan Lee

Publication date 9 February 2023

Full work available at URL https://doi.org/10.1007/978-3-031-43380-1_13

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Abstract: We introduce graph width parameters, called $alpha$-edge-crossing width and edge-crossing width. These are defined in terms of the number of edges crossing a bag of a tree-cut decomposition. They are motivated by edge-cut width, recently introduced by Brand et al. (WG 2022). We show that edge-crossing width is equivalent to the known parameter tree-partition-width. On the other hand, $alpha$-edge-crossing width is a new parameter; tree-cut width and $alpha$-edge-crossing width are incomparable, and they both lie between tree-partition-width and edge-cut width. We provide an algorithm that, for a given $n$-vertex graph $G$ and integers $k$ and $alpha$, in time $2^{O((alpha+k)log(alpha+k))}{n}^2$ either outputs a tree-cut decomposition certifying that the $alpha$-edge-crossing width of $G$ is at most $2alph{a}^2+5k$ or confirms that the $alpha$-edge-crossing width of $G$ is more than $k$. As applications, for every fixed $alpha$, we obtain FPT algorithms for the List Coloring and Precoloring Extension problems parameterized by $alpha$-edge-crossing width. They were known to be W[1]-hard parameterized by tree-partition-width, and FPT parameterized by edge-cut width, and we close the complexity gap between these two parameters.

Cited in

(1)

• A new width parameter of graphs based on edge cuts: -edge-crossing width

This page was built for publication: A new width parameter of graphs based on edge cuts: $\alpha$-edge-crossing width

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6425938)