Author:
Goldberg Leslie Ann,Jerrum Mark
Abstract
AbstractThe problem of counting unlabelled subtrees of a tree (that is, sub-trees that are distinct up to isomorphism) is #P-complete, and hence equivalent in computational difficulty to evaluating the permanent of a 0,1-matrix.
Subject
Computational Theory and Mathematics,General Mathematics
Reference12 articles.
1. Efficient Planarity Testing
2. ‘Polynomial-time 1-Turing reductions from #PH to #P’;Toda;Theoret. Comput. Set,1992
3. 3. Garey M. R. and Johnson D. S. , Computers and intractability: a guide to the theory of NP-completeness (Freeman, San Francisco, CA, 1979).
4. Complexity: Knots, Colourings and Countings
5. The complexity of harmonious colouring for trees
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献