eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Leibniz International Proceedings in Informatics
1868-8969
2020-12-04
6:1
6:18
10.4230/LIPIcs.IPEC.2020.6
article
Bounding the Mim-Width of Hereditary Graph Classes
Brettell, Nick
1
https://orcid.org/0000-0002-1136-418X
Horsfield, Jake
2
https://orcid.org/0000-0002-4388-5123
Munaro, Andrea
3
https://orcid.org/0000-0003-1509-8832
Paesani, Giacomo
4
https://orcid.org/0000-0002-2383-1339
Paulusma, Daniël
4
https://orcid.org/0000-0001-5945-9287
School of Mathematics and Statistics, Victoria University of Wellington, New Zealand
School of Computing, University of Leeds, UK
School of Mathematics and Physics, Queen’s University Belfast, UK
Department of Computer Science, Durham University, UK
A large number of NP-hard graph problems are solvable in XP time when parameterized by some width parameter. Hence, when solving problems on special graph classes, it is helpful to know if the graph class under consideration has bounded width. In this paper we consider mim-width, a particularly general width parameter that has a number of algorithmic applications whenever a decomposition is "quickly computable" for the graph class under consideration.
We start by extending the toolkit for proving (un)boundedness of mim-width of graph classes. By combining our new techniques with known ones we then initiate a systematic study into bounding mim-width from the perspective of hereditary graph classes, and make a comparison with clique-width, a more restrictive width parameter that has been well studied.
We prove that for a given graph H, the class of H-free graphs has bounded mim-width if and only if it has bounded clique-width. We show that the same is not true for (H₁,H₂)-free graphs. We identify several general classes of (H₁,H₂)-free graphs having unbounded clique-width, but bounded mim-width, illustrating the power of mim-width. Moreover, we show that a branch decomposition of constant mim-width can be found in polynomial time, for these classes. Hence, as mentioned, these results have algorithmic implications: when the input is restricted to such a class of (H₁,H₂)-free graphs, many problems become polynomial-time solvable, including classical problems such as k-Colouring and Independent Set, domination-type problems known as LC-VSVP problems, and distance versions of LC-VSVP problems, to name just a few. We also prove a number of new results showing that, for certain H₁ and H₂, the class of (H₁,H₂)-free graphs has unbounded mim-width.
Boundedness of clique-width implies boundedness of mim-width. By combining our results, which give both new bounded and unbounded cases for mim-width, with the known bounded cases for clique-width, we present summary theorems of the current state of the art for the boundedness of mim-width for (H₁,H₂)-free graphs. In particular, we classify the mim-width of (H₁,H₂)-free graphs for all pairs (H₁,H₂) with |V(H₁)| + |V(H₂)| ≤ 8. When H₁ and H₂ are connected graphs, we classify all pairs (H₁,H₂) except for one remaining infinite family and a few isolated cases.
https://drops.dagstuhl.de/storage/00lipics/lipics-vol180-ipec2020/LIPIcs.IPEC.2020.6/LIPIcs.IPEC.2020.6.pdf
Width parameter
mim-width
clique-width
hereditary graph class