Generalized distance domination problems and their complexity on graphs of bounded mim-width

03/09/2018
by   Lars Jaffke, et al.
University of Bergen
0

We generalise the family of (σ, ρ)-problems and locally checkable vertex partition problems to their distance versions, which naturally captures well-known problems such as distance-r dominating set and distance-r independent set. We show that these distance problems are XP parameterized by the structural parameter mim-width, and hence polynomial on graph classes where mim-width is bounded and quickly computable, such as k-trapezoid graphs, Dilworth k-graphs, (circular) permutation graphs, interval graphs and their complements, convex graphs and their complements, k-polygon graphs, circular arc graphs, H-graphs and complements to d-degenerate graphs. To supplement these findings, we show that many classes of (distance) (σ, ρ)-problems are W[1]-hard parameterized by mim-width + solution size.

READ FULL TEXT

page 1

page 2

page 3

page 4

10/02/2019

Node Multiway Cut and Subset Feedback Vertex Set on Graphs of Bounded Mim-width

The two weighted graph problems Node Multiway Cut (NMC) and Subset Feedb...
09/27/2017

On the tractability of optimization problems on H-graphs

For a graph H, a graph G is an H-graph if it is an intersection graph of...
05/04/2021

Classes of intersection digraphs with good algorithmic properties

An intersection digraph is a digraph where every vertex v is represented...
03/29/2022

On d-stable locally checkable problems on bounded mim-width graphs

In this paper we continue the study of locally checkable problems under ...
05/01/2019

Independent Set Reconfiguration Parameterized by Modular-Width

Independent Set Reconfiguration is one of the most well-studied problems...
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...
08/20/2020

Solving problems on generalized convex graphs via mim-width

A bipartite graph G=(A,B,E) is H-convex, for some family of graphs H, if...

Please sign up or login with your details

Forgot password? Click here to reset