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.

[1]  Bruno Courcelle,et al.  Linear Time Solvable Optimization Problems on Graphs of Bounded Clique-Width , 2000, Theory of Computing Systems.

[2]  Paul D. Seymour,et al.  Approximating clique-width and branch-width , 2006, J. Comb. Theory, Ser. B.

[3]  Jörg Flum,et al.  Parameterized Complexity Theory , 2006, Texts in Theoretical Computer Science. An EATCS Series.

[4]  Michael R. Fellows,et al.  Fixed-Parameter Tractability and Completeness II: On Completeness for W[1] , 1995, Theor. Comput. Sci..

[5]  Michal Pilipczuk,et al.  Parameterized Algorithms , 2015, Springer International Publishing.

[6]  Paul D. Seymour,et al.  Graph minors. X. Obstructions to tree-decomposition , 1991, J. Comb. Theory, Ser. B.

[7]  Reinhard Diestel,et al.  k-Blocks: A Connectivity Invariant for Graphs , 2013, SIAM J. Discret. Math..

[8]  Sang-il Oum,et al.  Rank-width: Algorithmic and structural results , 2016, Discret. Appl. Math..

[9]  Dimitrios M. Thilikos,et al.  Constructive Linear Time Algorithms for Branchwidth , 1997, ICALP.

[10]  Mamadou Moustapha Kanté,et al.  F-rank-width of (edge-colored) graphs , 2011, CAI 2011.

[11]  Egon Wanke,et al.  Line graphs of bounded clique-width , 2007, Discret. Math..

[12]  Mohammad Ali Safari.  D-Width: A More Natural Measure for Directed Tree Width , 2005, MFCS.

[13]  Umberto Bertelè,et al.  Nonserial Dynamic Programming , 1972 .

[14]  Petr A. Golovach,et al.  Intractability of Clique-Width Parameterizations , 2010, SIAM J. Comput..

[15]  Bruno Courcelle,et al.  The Monadic Second-Order Logic of Graphs. I. Recognizable Sets of Finite Graphs , 1990, Inf. Comput..

[16]  Michael Lampis,et al.  On the algorithmic effectiveness of digraph decompositions and complexity measures , 2008, Discret. Optim..

[17]  Petr Hliněný,et al.  Are There Any Good Digraph Width Measures? , 2010, IPEC.

[18]  Nicolas Nisse,et al.  Submodular partition functions , 2009, Discret. Math..

[19]  Stephan Kreutzer,et al.  Digraphs of Bounded Width , 2018, Classes of Directed Graphs.

[20]  Frank Harary,et al.  Graph Theory , 2016 .

[21]  Reinhard Diestel,et al.  Unifying Duality Theorems for Width Parameters in Graphs and Matroids (Extended Abstract) , 2014, WG.

[22]  Bruno Courcelle,et al.  Handle-Rewriting Hypergraph Grammars , 1993, J. Comput. Syst. Sci..

[23]  R. Halin.  S-functions for graphs , 1976 .

[24]  Reinhard Diestel,et al.  Tangle-tree duality in abstract separation systems , 2017, 1701.02509.

[25]  Stephan Kreutzer,et al.  Digraph measures: Kelly decompositions, games, and orderings , 2007, SODA '07.

[26]  Bruno Courcelle,et al.  Linear Time Solvable Optimization Problems on Graphs of Bounded Clique Width , 1998, WG.

[27]  Egon Wanke,et al.  Directed NLC-width , 2016, Theor. Comput. Sci..

[28]  Reinhard Diestel,et al.  Profiles of Separations: in Graphs, Matroids, and Beyond , 2011, Comb..

[29]  Udi Rotics,et al.  On the Relationship between Clique-Width and Treewidth , 2001, WG.

[30]  Stephan Kreutzer,et al.  The dag-width of directed graphs , 2012, J. Comb. Theory, Ser. B.

[31]  Nicolas Nisse,et al.  A unified FPT Algorithm for Width of Partition Functions , 2013 .

[32]  Paul D. Seymour,et al.  Graph Minors. II. Algorithmic Aspects of Tree-Width , 1986, J. Algorithms.

[33]  Vít Jelínek.  The Rank-Width of the Square Grid , 2008, WG.

[34]  Sang-il Oum,et al.  Rank‐width is less than or equal to branch‐width , 2008, J. Graph Theory.

[35]  Michael R. Fellows,et al.  Fundamentals of Parameterized Complexity , 2013 .

[36]  Robin Thomas,et al.  Call routing and the ratcatcher , 1994, Comb..

[37]  H. Whitney.  Congruent Graphs and the Connectivity of Graphs , 1932 .