Entanglement and the complexity of directed graphs

Entanglement is a parameter for the complexity of finite directed graphs that measures to what extent the cycles of the graph are intertwined. It is defined by way of a game similar in spirit to the cops and robber games used to describe treewidth, directed treewidth, and hypertree width. Nevertheless, on many classes of graphs, there are significant differences between entanglement and the various incarnations of treewidth. Entanglement is intimately related with the computational and descriptive complexity of the modal @m-calculus. The number of fixed-point variables needed to describe a finite graph up to bisimulation is captured by its entanglement. This plays a crucial role in the proof that the variable hierarchy of the @m-calculus is strict. We study complexity issues for entanglement and compare it to other structural parameters of directed graphs. One of our main results is that parity games of bounded entanglement can be solved in polynomial time. Specifically, we establish that the complexity of solving a parity game can be parametrised in terms of the minimal entanglement of subgames induced by a winning strategy. Furthermore, we discuss the case of graphs of entanglement two. While graphs of entanglement zero and one are very simple, graphs of entanglement two allow arbitrary nesting of cycles, and they form a sufficiently rich class for modelling relevant classes of structured systems. We provide characterisations of this class, and propose decomposition notions similar to the ones for treewidth, DAG-width, and Kelly-width.

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

[2]  Dietmar Berwanger,et al.  The Variable Hierarchy of the μ-Calculus Is Strict , 2006, Theory of Computing Systems.

[3]  Dexter Kozen,et al.  Results on the Propositional µ-Calculus , 1982, ICALP.

[4]  M. Safari.  D-width, metric embedding, and their connections , 2007 .

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

[6]  Dexter Kozen,et al.  RESULTS ON THE PROPOSITIONAL’p-CALCULUS , 2001 .

[7]  Dietmar Berwanger,et al.  On the Variable Hierarchy of the Modal µ-Calculus , 2002, CSL.

[8]  Peter Lammich,et al.  Tree Automata , 2009, Arch. Formal Proofs.

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

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

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

[12]  R. L. Thews.  The D * width , 1978 .

[13]  Neil D. Jones,et al.  Space-Bounded Reducibility among Combinatorial Problems , 1975, J. Comput. Syst. Sci..

[14]  L. Eggan.  Transition graphs and the star-height of regular events. , 1963 .

[15]  Roman Rabinovich,et al.  Complexity Measures for Directed Graphs , 2009 .

[16]  Wieslaw Zielonka,et al.  Infinite Games on Finitely Coloured Graphs with Applications to Automata on Infinite Trees , 1998, Theor. Comput. Sci..

[17]  Paul D. Seymour,et al.  Graph minors. I. Excluding a forest , 1983, J. Comb. Theory, Ser. B.

[18]  Stephan Kreutzer,et al.  Digraph Decompositions and Monotonicity in Digraph Searching , 2008, WG.

[19]  Jan Obdrzálek,et al.  Fast Mu-Calculus Model Checking when Tree-Width Is Bounded , 2003, CAV.

[20]  Colin Stirling,et al.  Bisimulation, Modal Logic and Model Checking Games , 1999, Logic Journal of the IGPL.

[21]  Stephan Kreutzer,et al.  Digraph decompositions and monotonicity in digraph searching , 2008, Theor. Comput. Sci..

[22]  E. Allen Emerson,et al.  Tree automata, mu-calculus and determinacy , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

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

[24]  Paul D. Seymour,et al.  Graph minors. III. Planar tree-width , 1984, J. Comb. Theory B.

[25]  Marcin Jurdzinski,et al.  Small Progress Measures for Solving Parity Games , 2000, STACS.

[26]  Dietmar Berwanger,et al.  Entanglement - A Measure for the Complexity of Directed Graphs with Applications to Logic and Games , 2005, LPAR.

[27]  Luigi Santocanale,et al.  Undirected Graphs of Entanglement 2 , 2007, FSTTCS.

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

[29]  Hans L. Bodlaender,et al.  A Partial k-Arboretum of Graphs with Bounded Treewidth , 1998, Theor. Comput. Sci..

[30]  Anuj Dawar,et al.  The Descriptive Complexity of Parity Games , 2008, CSL.

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

[32]  Lukasz Kaiser,et al.  Directed Graphs of Entanglement Two , 2009, FCT.

[33]  José L. Balcázar,et al.  Structural complexity 1 , 1988 .