Author:
Langer Alexander,Rossmanith Peter,Sikdar Somnath
Publisher
Springer Berlin Heidelberg
Reference22 articles.
1. Arnborg, S., Lagergren, J., Seese, D.: Easy problems for tree-decomposable graphs. J. Algorithms 12(2), 308–340 (1991)
2. Berlekamp, E.R., Conway, J.H., Guy, R.K.: Winning Ways for Your Mathematical Plays. A.K. Peters, Wellesley (1982)
3. Courcelle, B.: The monadic second order theory of Graphs I: Recognisable sets of finite graphs. Information and Computation 85, 12–75 (1990)
4. Courcelle, B.: Monadic second-order definable graph transductions: A survey. Theor. Comput. Sci. 126(1), 53–75 (1994)
5. Lecture Notes in Computer Science;B. Courcelle,2007
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Transforming graph states using single-qubit operations;Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences;2018-05-28
2. Declarative Dynamic Programming as an Alternative Realization of Courcelle’s Theorem;Parameterized and Exact Computation;2013
3. On Complexities of Minus Domination;Combinatorial Optimization and Applications;2013
4. Confronting intractability via parameters;Computer Science Review;2011-11