On algorithmic applications of sim-width and mim-width of (H_1, H_2)-free graphs

05/30/2022
βˆ™
by   Andrea Munaro, et al.
βˆ™
Queen's University Belfast
βˆ™
0
βˆ™

Mim-width and sim-width are among the most powerful graph width parameters, with sim-width more powerful than mim-width, which is in turn more powerful than clique-width. While several 𝖭𝖯-hard graph problems become tractable for graph classes whose mim-width is bounded and quickly computable, no algorithmic applications of boundedness of sim-width are known. In [Kang et al., A width parameter useful for chordal and co-comparability graphs, Theoretical Computer Science, 704:1-17, 2017], it is asked whether Independent Set and 3-Colouring are 𝖭𝖯-complete on graphs of sim-width at most 1. We observe that, for each k βˆˆβ„•, List k-Colouring is polynomial-time solvable for graph classes whose sim-width is bounded and quickly computable. Moreover, we show that if the same holds for Independent Set, then Independent β„‹-Packing is polynomial-time solvable for graph classes whose sim-width is bounded and quickly computable. This problem is a common generalisation of Independent Set, Induced Matching, Dissociation Set and k-Separator. We also make progress toward classifying the mim-width of (H_1,H_2)-free graphs in the case H_1 is complete or edgeless. Our results solve some open problems in [Brettell et al., Bounding the mim-width of hereditary graph classes, Journal of Graph Theory, 99(1):117-151, 2022].

READ FULL TEXT

page 1

page 2

page 3

page 4

βˆ™ 04/10/2020

Bounding the Mim-Width of Hereditary Graph Classes

A large number of NP-hard graph problems become polynomial-time solvable...
βˆ™ 07/14/2022

Component twin-width as a parameter for BINARY-CSP and its semiring generalisations

We investigate the fine-grained and the parameterized complexity of seve...
βˆ™ 02/21/2023

New Width Parameters for Independent Set: One-sided-mim-width and Neighbor-depth

We study the tractability of the maximum independent set problem from th...
βˆ™ 01/04/2021

A polynomial time construction of a hitting set for read-once branching programs of width 3

Recently, an interest in constructing pseudorandom or hitting set genera...
βˆ™ 01/02/2019

Clique-Width for Hereditary Graph Classes

Clique-width is a well-studied graph parameter owing to its use in under...
βˆ™ 08/03/2020

List k-Colouring P_t-Free Graphs with No Induced 1-Subdivision of K_1,s: a Mim-width Perspective

A colouring of a graph G=(V,E) is a mapping c Vβ†’{1,2,…} such that c(u)β‰  ...
βˆ™ 07/28/2020

Twin-width III: Max Independent Set and Coloring

We recently introduced the graph invariant twin-width, and showed that f...

Please sign up or login with your details

Forgot password? Click here to reset