|
|
|
|
LEADER |
01255 am a22001813u 4500 |
001 |
2819 |
042 |
|
|
|a dc
|
100 |
1 |
0 |
|a Liu, J
|e author
|
700 |
1 |
0 |
|a Khoussainov, B
|e author
|
700 |
1 |
0 |
|a Gandhi, A
|e author
|
245 |
0 |
0 |
|a Solving infinite games on trees with back-edges
|
260 |
|
|
|b Australian Computer Society (ACS),
|c 2011-11-27T08:42:52Z.
|
500 |
|
|
|a In Proc. Computing: The Australasian Theory Symposium (CATS 2012) Melbourne, Australia. CRPIT, 128. Mestre, J. Eds., ACS. 113-122
|
500 |
|
|
|a 1445-1336
|
520 |
|
|
|a We study the computational complexity of solving the following problem: Given a game G played on a fi- nite directed graph G, output all nodes in G from which a specific player wins the game G. We pro- vide algorithms for solving the above problem when the games have Büchi and parity winning conditions and the graph G is a tree with back-edges. The running time of the algorithm for Büchi games is O(min{r·m,ℓ+m}) where m is the number of edges, ℓ is the sum of the distances from the root to all leaves and the parameter r is bounded by the height of the tree. The algorithm for parity has a running time of O(ℓ + m).
|
540 |
|
|
|a OpenAccess
|
655 |
7 |
|
|a Conference Contribution
|
856 |
|
|
|z Get fulltext
|u http://hdl.handle.net/10292/2819
|