A dynamic algorithm for reachability games on trees

Khoussainov, B; Liu, J; Khaliq, I

doi:10.1007/978-3-642-03816-7_41

Khoussainov, B; Liu, J; Khaliq, I

Abstract

Our goal is to start the investigation of dynamic algorithms for solving games that are played on finite graphs. The dynamic game determinacy problem calls for finding efficient algorithms that decide the winner of the game when the underlying graph undergoes repeated modifications. In this paper, we focus on turn-based reachability games. We provide an algorithm that solves the dynamic reachability game problem on trees. The amortized time complexity of our algorithm is O(logn), where n is the number of nodes in the current graph.

Date

2009

Source

24th International Symposium of Mathematical Foundations of Computer Science (MFCS'09, High Tatras, Slovakia, 2009-08-24 - 2009-08-28, vol.Lecture Notes in Computer Science 5734, pages 518 - 529

Item Type

Conference Contribution

Publisher

Springer

DOI

10.1007/978-3-642-03816-7_41

Publisher's Version

http://www.springerlink.com/content/vr1g77267833011l/

Rights Statement

An author may self-archive an author-created version of his/her article on his/her own website and or in his/her institutional repository. He/she may also deposit this version on his/her funder’s or funder’s designated repository at the funder’s request or as a result of a legal obligation, provided it is not made publicly available until 12 months after official publication. He/ she may not use the publisher's PDF version, which is posted on www.springerlink.com, for the purpose of self-archiving or deposit. Furthermore, the author may only post his/her version provided acknowledgement is given to the original source of publication and a link is inserted to the published article on Springer's website. The link must be accompanied by the following text: "The final publication is available at www.springerlink.com”. (Please also see Publisher’s Version and Citation)