DAG-width and parity games

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3884 LNCS, Issue , 2006, Pages 524-536

  Berwanger, Dietmar ^a   Dawar, Anuj ^b   Hunter, Paul ^c   Kreutzer, Stephan ^c  

^a UNIVERSITÉ BORDEAUX 1   (France)

^b UNIVERSITY OF CAMBRIDGE   (United Kingdom)

^c HUMBOLDT UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COPS-AND-ROBBER GAME; DIRECTED ACYCLIC GRAPH (DAG); GRAPH DECOMPOSITION; TREE-WIDTH;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; GAME THEORY; HAMILTONIANS; POLYNOMIALS; TREES (MATHEMATICS);

GRAPH THEORY;

EID: 33745617660     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11672142_43     Document Type: Conference Paper

References (15)

1. J. BARÁT, Directed path-width and monotonicity in digraph searching. To appear in Graphs and Combinatorics.
2. D. BERWANGER AND E. GRÄDEL, Entanglement - a measure for the complexity of directed graphs with applications to logic and games, in LPAR, 2004, pp. 209-223.
3. H. L. BODLAENDER, Treewidth: Algorithmic techniques and results, in MFCS, 1997, pp. 19-36.
4. B. COURCELLE, Graph rewriting: An algebraic and logic approach, in Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B), J. van Leeuwan, ed., 1990, pp. 193-242.
5. N. D. DENDRIS, L. M. KIROUSIS, AND D.M. THILIKOS, Fugitive-search games on graphs and related parameters, TCS, 172 (1997), pp. 233-254.
6. E. EMERSON, C. JUTLA, AND A. SISTLA, On model checking for the μ-calculus and its fragments, TCS, 258 (2001), pp. 491-522.
7. G. GOTTLOB, N. LEONE, AND F. SCARCELLO, Robbers, marshals, and guards: Game theoretic and logical characterizations of hypertree width, in PODS, 2001, pp. 195-201.
8. T. JOHNSON, N. ROBERTSON, P. D. SEYMOUR, AND R. THOMAS, Directed tree-width, Journal of Combinatorial Theory, Series B, 82 (2001), pp. 138-154.
9. M. JURDZIŃSKI, Deciding the winner in parity games is in UP ∩ co-UP, Information Processing Letters, 68 (1998), pp. 119-124.
10. D. KOZEN, Results on the prepositional mu-calculus, TCS, 27 (1983), pp. 333-354.
11. J. OBDRŽÁLEK, Fast mu-calculus model checking when tree-width is bounded, in Proceedings of 15th International Conference on Computer Aided Verification, vol. 2725 of LNCS, Springer, 2003, pp. 80-92.
12. B. A. REED, Introducing directed tree width, in 6th Twente Workshop on Graphs and Combinatorial Optimization, vol. 3 of Electron. Notes Discrete Math, Elsevier, 1999.
13. N. ROBERTSON AND P. SEYMOUR, Graph Minors. III. Planar tree-width, Journal of Combinatorial Theory, Series B, 36 (1984), pp. 49-63.
14. M. SAFARI, D-width: A more natural measure for directed tree width, in MFCS 2005, vol. 3618 of LNCS, Springer, 2005, pp. 745-756.
15. P. SEYMOUR AND R. THOMAS, Graph searching, and a min-max theorem for tree-width, Journal of Combinatorial Theory, Series B, 58 (1993), pp. 22-33.