Counting trees in a graph is #P-complete
- 10 August 1994
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 51 (3) , 111-116
- https://doi.org/10.1016/0020-0190(94)00085-9
Abstract
No abstract availableKeywords
This publication has 2 references indexed in Scilit:
- The Complexity of Enumeration and Reliability ProblemsSIAM Journal on Computing, 1979
- The Planar Hamiltonian Circuit Problem is NP-CompleteSIAM Journal on Computing, 1976