Publisher
Springer Berlin Heidelberg
Reference19 articles.
1. Lecture Notes in Computer Science;D. Berwanger,2006
2. Lecture Notes in Artificial Intelligence;D. Berwanger,2005
3. Lecture Notes in Computer Science;H. Björklund,2003
4. Courcelle, B.: Graph rewriting: An algebraic and logic approach. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science: Volume B: Formal Models and Semantics, pp. 193–242. Elsevier, Amsterdam (1990)
5. Courcelle, B., Makowsky, J.A., Rotics, U.: Linear time solvable optimization problems on graphs of bounded clique-width. Theory Comput. Syst. 33(2), 125–150 (2000)
Cited by
14 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Solving parity games via priority promotion;Formal Methods in System Design;2018-01-31
2. Digraphs of Bounded Width;Springer Monographs in Mathematics;2018
3. The mu-calculus and Model Checking;Handbook of Model Checking;2018
4. Solving Parity Games via Priority Promotion;Computer Aided Verification;2016
5. New Deterministic Algorithms for Solving Parity Games;LATIN 2016: Theoretical Informatics;2016