A Dynamic Algorithm for Reachability Games Played on Trees

DOI10.1007/978-3-642-03816-7_41zbMath1250.68192OpenAlexW1484453694MaRDI QIDQ3182948

Imran Khaliq, Jiamou Liu, Bakhadyr Khoussainov

Publication date: 16 October 2009

Published in: Mathematical Foundations of Computer Science 2009 (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10292/2809

Mathematics Subject Classification ID

Games involving graphs (91A43) Specification and verification (program logics, model checking, etc.) (68Q60)

Cites Work

• Number of quantifiers is better than number of tape cells
• Automata, logics, and infinite games. A guide to current research
• A Game Theoretic Approach to the Analysis of Dynamic Networks
• A fully dynamic reachability algorithm for directed graphs with an almost linear update time
• A new approach to dynamic all pairs shortest paths
• Model Checking Games
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A Dynamic Algorithm for Reachability Games Played on Trees