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

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.

READ FULL TEXT