Time and Parallelizability Results for Parity Games with Bounded Treewidth-Reference-Cited by-同舟云学术

Time and Parallelizability Results for Parity Games with Bounded Treewidth

Published:2012 Issue: Volume: Page:189-200
ISSN:0302-9743
Container-title:Automata, Languages, and Programming
language:
Short-container-title:

Author:

Fearnley John,Schewe Sven

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-31585-5_20.pdf

Reference13 articles.

1. Allender, E., Loui, M.C., Regan, K.W.: Complexity classes. In: Atallah, M.J., Blanton, M. (eds.) Algorithms and Theory of Computation Handbook, p. 22. Chapman & Hall/CRC (2010)

2. Amir, E.: Efficient approximation for triangulation of minimum treewidth. In: Proc. of UAI, pp. 7–15. Morgan Kaufmann Publishers Inc., San Francisco (2001)

3. Lecture Notes in Computer Science;D. Berwanger,2006

4. Lecture Notes in Artificial Intelligence;D. Berwanger,2005

5. Bodlaender, H.L.: A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM Journal on Computing 25(6), 1305–1317 (1996)

Cited by 9 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Efficient approximations for cache-conscious data placement;Proceedings of the 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation;2022-06-09

2. New deterministic algorithms for solving parity games;Discrete Optimization;2018-11

3. Solving parity games via priority promotion;Formal Methods in System Design;2018-01-31

4. Graph operations on parity games and polynomial-time algorithms;Theoretical Computer Science;2016-02

5. Solving Parity Games via Priority Promotion;Computer Aided Verification;2016