Are there any good digraph width measures?

Many width measures for directed graphs have been proposed in the last few years in pursuit of generalizing (the notion of) treewidth to directed graphs. However, none of these measures possesses, at the same time, the major properties of treewidth, namely,1.being algorithmically useful, that is, admitting polynomial-time algorithms for a large class of problems on digraphs of bounded width (e.g. the problems definable in MSO 1 );2.having nice structural properties such as being (at least nearly) monotone under taking subdigraphs and some form of arc contractions (property closely related to characterizability by particular cops-and-robber games). We investigate the question whether the search for directed treewidth counterparts has been unsuccessful by accident, or whether it has been doomed to fail from the beginning. Our main result states that any reasonable width measure for directed graphs which satisfies the two properties above must necessarily be similar to treewidth of the underlying undirected graph.

[1]  David S. Johnson,et al.  Some Simplified NP-Complete Graph Problems , 1976, Theor. Comput. Sci..

[2]  John E. Hopcroft,et al.  The Directed Subgraph Homeomorphism Problem , 1978, Theor. Comput. Sci..

[3]  Jan Obdrzálek,et al.  DAG-width: connectivity measure for directed graphs , 2006, SODA '06.

[4]  Wilfrid Hodges,et al.  A Shorter Model Theory , 1997 .

[5]  Mamadou Moustapha Kanté.  The rank-width of Directed Graphs , 2007, ArXiv.

[6]  Shiva Kintali,et al.  Forbidden directed minors and Kelly-width , 2017, Theor. Comput. Sci..

[7]  P. W. Hunter,et al.  Complexity and infinite games on finite graphs , 2007 .

[8]  Robert Ganian,et al.  Digraph width measures in parameterized algorithmics , 2014, Discret. Appl. Math..

[9]  Stephan Kreutzer,et al.  Lower Bounds for the Complexity of Monadic Second-Order Logic , 2010, 2010 25th Annual IEEE Symposium on Logic in Computer Science.

[10]  Richard J. Lipton,et al.  Some connections between nonuniform and uniform complexity classes , 1980, STOC '80.

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

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

[13]  Paul D. Seymour,et al.  Graph Minors: XV. Giant Steps , 1996, J. Comb. Theory, Ser. B.

[14]  Mamadou Moustapha Kanté,et al.  The Rank-Width of Edge-Coloured Graphs , 2007, Theory of Computing Systems.

[15]  Bruno Courcelle,et al.  Upper bounds to the clique width of graphs , 2000, Discret. Appl. Math..

[16]  Hans L. Bodlaender,et al.  Treewidth: Characterizations, Applications, and Computations , 2006, WG.

[17]  R. L. Brooks.  On Colouring the Nodes of a Network , 1941 .

[18]  Martin Tancer,et al.  List-Coloring Squares of Sparse Subcubic Graphs , 2008, SIAM J. Discret. Math..

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

[20]  Paul D. Seymour,et al.  Tournament minors , 2012, J. Comb. Theory, Ser. B.

[21]  Robert Ganian,et al.  Clique-width: When Hard Does Not Mean Impossible , 2011, STACS.

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

[23]  Robert Ganian,et al.  On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width , 2010, Discret. Appl. Math..

[24]  Robin Thomas,et al.  Quickly Excluding a Planar Graph , 1994, J. Comb. Theory, Ser. B.

[25]  Reinhard Diestel,et al.  Graph Theory , 1997 .

[26]  Stephan Kreutzer,et al.  DAG-Width and Parity Games , 2006, STACS.

[27]  János Pach,et al.  How to draw a planar graph on a grid , 1990, Comb..

[28]  Johann A. Makowsky,et al.  Tree-width and the monadic quantifier hierarchy , 2003, Theor. Comput. Sci..

[29]  W. Mader.  On topological tournaments of order 4 in digraphs of outdegree 3 , 1996 .

[30]  Stephan Kreutzer,et al.  Directed nowhere dense classes of graphs , 2011, SODA.

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

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

[33]  Robin Thomas,et al.  Directed Tree-Width , 2001, J. Comb. Theory, Ser. B.

[34]  Petr Hliněný,et al.  Lower bounds on the complexity of MSO1 model-checking , 2014, J. Comput. Syst. Sci..

[35]  Paul D. Seymour,et al.  Graph minors. IV. Tree-width and well-quasi-ordering , 1990, J. Comb. Theory, Ser. B.

[36]  Detlef Seese,et al.  Easy Problems for Tree-Decomposable Graphs , 1991, J. Algorithms.

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

[38]  B. A. Reed,et al.  Algorithmic Aspects of Tree Width , 2003 .

[39]  János Barát.  Directed Path-width and Monotonicity in Digraph Searching , 2006, Graphs Comb..

[40]  Jörg Flum,et al.  Mathematical logic , 1985, Undergraduate texts in mathematics.

[41]  Michael R. Fellows,et al.  Parameterized Complexity , 1998 .

[42]  Robert Ganian,et al.  A unified approach to polynomial algorithms on graphs of bounded (bi-)rank-width , 2013, Eur. J. Comb..

[43]  Xiao-Dong Hu,et al.  A Min-Max Theorem on Tournaments , 2007, SIAM J. Comput..

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

[45]  Georg Gottlob,et al.  Width Parameters Beyond Tree-width and their Applications , 2008, Comput. J..

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

[47]  Robin Thomas,et al.  Graph Searching and a Min-Max Theorem for Tree-Width , 1993, J. Comb. Theory, Ser. B.

[48]  Aleksandrs Slivkins,et al.  Parameterized Tractability of Edge-Disjoint Paths on Directed Acyclic Graphs , 2003, SIAM J. Discret. Math..

[49]  Bruno Courcelle,et al.  Graph Structure and Monadic Second-Order Logic - A Language-Theoretic Approach , 2012, Encyclopedia of mathematics and its applications.