Abstract
This paper studies the problem of solving parity games on graphs with bounded tree-width. Previous work by Obdržálek has produced an algorithm that uses nO(k2) time and nO(k2) space, where k is the tree-width of the graph that the game is played on. This paper presents an algorithm that uses n O(k log n) time and O(n + k logn) space. This is the fastest known algorithm for parity games whose tree-width k satisfies (in standard asymptotic notation) k ε ω(log n) and k ε o(√n/log n. © 2011 Springer-Verlag GmbH.
Cite
CITATION STYLE
Fearnley, J., & Lachish, O. (2011). Parity games on graphs with medium tree-width. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6907 LNCS, pp. 303–314). https://doi.org/10.1007/978-3-642-22993-0_29
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
