Classes of intersection digraphs with good algorithmic properties

by   Lars Jaffke, et al.

An intersection digraph is a digraph where every vertex v is represented by an ordered pair (S_v, T_v) of sets such that there is an edge from v to w if and only if S_v and T_w intersect. An intersection digraph is reflexive if S_v∩ T_v≠∅ for every vertex v. Compared to well-known undirected intersection graphs like interval graphs and permutation graphs, not many algorithmic applications on intersection digraphs have been developed. Motivated by the successful story on algorithmic applications of intersection graphs using a graph width parameter called mim-width, we introduce its directed analogue called `bi-mim-width' and prove that various classes of reflexive intersection digraphs have bounded bi-mim-width. In particular, we show that as a natural extension of H-graphs, reflexive H-digraphs have linear bi-mim-width at most 12|E(H)|, which extends a bound on the linear mim-width of H-graphs [On the Tractability of Optimization Problems on H-Graphs. Algorithmica 2020]. For applications, we introduce a novel framework of directed versions of locally checkable problems, that streamlines the definitions and the study of many problems in the literature and facilitates their common algorithmic treatment. We obtain unified polynomial-time algorithms for these problems on digraphs of bounded bi-mim-width, when a branch decomposition is given. Locally checkable problems include Kernel, Dominating Set, and Directed H-Homomorphism.


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

We generalise the family of (σ, ρ)-problems and locally checkable vertex...

Directed branch-width: A directed analogue of tree-width

We introduce a new digraph width measure called directed branch-width. T...

Functionality of box intersection graphs

Functionality is a graph complexity measure that extends a variety of pa...

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...

Comparing Linear Width Parameters for Directed Graphs

In this paper we introduce the linear clique-width, linear NLC-width, ne...

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

We investigate the fine-grained and the parameterized complexity of seve...

Compositional Algorithms on Compositional Data: Deciding Sheaves on Presheaves

Algorithmicists are well-aware that fast dynamic programming algorithms ...

Please sign up or login with your details

Forgot password? Click here to reset