Article contents
Counting Unlabelled Subtrees of a Tree is #P-complete
Published online by Cambridge University Press: 01 February 2010
Abstract
The 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.
- Type
- Research Article
- Information
- Copyright
- Copyright © London Mathematical Society 2000
References
- 4
- Cited by