A Dynamic Algorithm for Reachability Games Played on Trees

DOI10.1007/978-3-642-03816-7_41MaRDI QIDQ3182948zbMATH OpenOpenAlexFDO

Authors Bakhadyr Khoussainov, Jiamou Liu, Imran Khaliq

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

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

Recommendations

• Efficient algorithms for games played on trees with back-edges
• Game tree algorithms and solution trees
• On the complexity of searching game trees and other recursion trees
• Fast algorithms for finding randomized strategies in game trees
• The Complexity of Algorithms Computing Game Trees on Random Assignments
• A Dijkstra-type algorithm for dynamic games
• Tree projections: Game characterization and computational aspects
• scientific article; zbMATH DE number 6829368

Cites work

• scientific article; zbMATH DE number 3936534 (Why is no real title available?)
• scientific article; zbMATH DE number 1903345 (Why is no real title available?)
• A fully dynamic reachability algorithm for directed graphs with an almost linear update time
• A game theoretic approach to the analysis of dynamic networks
• A new approach to dynamic all pairs shortest paths
• Automata, logics, and infinite games. A guide to current research
• Introduction to algorithms
• Model Checking Games
• Number of quantifiers is better than number of tape cells

Cited in

(3)

• Resource Reachability Games on Pushdown Graphs
• scientific article; zbMATH DE number 6829368 (Why is no real title available?)
• Fundamentals of Computation Theory

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3182948)