论文信息 - Entanglement - A Measure for the Complexity of Directed Graphs with Applications to Logic and Games

Entanglement - A Measure for the Complexity of Directed Graphs with Applications to Logic and Games

We propose a new parameter for the complexity of finite directed graphs which measures to what extent the cycles of the graph are intertwined. This measure, called entanglement, is defined by way of a game that is somewhat similar in spirit to the robber and cops games used to describe tree width, directed tree width, and hypertree width. Nevertheless, on many classes of graphs, there are significant differences between entanglement and the various incarnations of tree width.

Dietmar Berwanger | Erich Grädel | E. Grädel | Dietmar Berwanger

[1] Alex K. Simpson,et al. Computational Adequacy in an Elementary Topos , 1998, CSL.

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

[3] D. Kozen. Results on the Propositional µ-Calculus , 1982 .

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

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

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

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

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

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

[10] José L. Balcázar,et al. Structural complexity 2 , 1990 .

[11] Dietmar Berwanger,et al. The Variable Hierarchy of the µ-Calculus Is Strict , 2005, STACS.

[12] Dietmar Berwanger,et al. Games and logical expressiveness , 2005 .

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