DeepAI AI Chat
Log In Sign Up

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

by   Benjamin Merlin Bumpus, et al.

We introduce a new digraph width measure called directed branch-width. To do this, we generalize a characterization of graph classes of bounded tree-width in terms of their line graphs to digraphs. Under parameterizations by directed branch-width we obtain linear time algorithms for many problems, such as directed Hamilton path and Max-Cut, which are hard when parameterized by other known directed width measures. More generally, we obtain an algorithmic meta-theorem for the model-checking problem for a restricted variant of MSO_2-logic on classes of bounded directed branch-width.


page 1

page 2

page 3

page 4


Computing directed path-width and directed tree-width of recursively defined digraphs

In this paper we consider the directed path-width and directed tree-widt...

A logic-based algorithmic meta-theorem for mim-width

We introduce a logic called distance neighborhood logic with acyclicity ...

Classes of intersection digraphs with good algorithmic properties

An intersection digraph is a digraph where every vertex v is represented...

Comparing Linear Width Parameters for Directed Graphs

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

Monoidal Width

We introduce monoidal width as a measure of the difficulty of decomposin...

Witnessing subsystems for probabilistic systems with low tree width

A standard way of justifying that a certain probabilistic property holds...

Point-width and Max-CSPs

The complexity of (unbounded-arity) Max-CSPs under structural restrictio...