Publisher
Springer Berlin Heidelberg
Reference34 articles.
1. S. ARNBORG, Graph decompositions and tree automata in reasoning with uncertainty, Journal of Theoretical and Experimental Artificial Intelligence 5 (1993) 335–357
2. S. ARNBORG, Decomposability helps for logics of knowledge and belief. Graph Transformations in Computer Science, Dagstuhl 1993, LNCS 776 37–50.
3. S. ARNBORG, A general purpose MSOL model checker and optimizer based on Boolean function representations. presented at the Fifth International Workshop on Graph Grammars and Their Application to Computer Science, Williamsburg, Nov 1994. http://BMW.nada.kth.se/~ stefan
4. S. ARNBORG, B. COURCELLE A. PROSKUROWSKI AND D. SEESE, An Algebraic Theory of Graph Reduction, Journ. ACM 40 (1993) 1134–1164.
5. S. ARNBORG, J. LAGERGREN AND D. SEESE, Easy Problems for Tree-decomposable graphs J. of Algorithms 12 (1991) 308–340.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献