Author:
Meer Klaus,Rautenbach Dieter
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference26 articles.
1. Easy problems for tree decomposable graphs;Arnborg;Journal of Algorithms 12,1991
2. NC-algorithms for graphs with small tree-width;Bodlaender,1989
3. On the size of binary decision diagrams representing Boolean functions;Breitbart;Theoretical Computer Science,1995
4. Graph-based algorithms for boolean function manipulation;Bryant;IEEE Transactions on Computers C-35,1986
5. Complement reducible graphs;Corneil;Discrete Applied Mathematics,1981
Cited by
14 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献