Loading...
Please wait, while we are loading the content...
Similar Documents
Counting Unlabelled Subtrees of a Tree is #P-complete
| Content Provider | Scilit |
|---|---|
| Author | Goldberg, Leslie Ann Jerrum, Mark |
| Copyright Year | 2000 |
| Description | Journal: LMS Journal of Computation and Mathematics 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. |
| Ending Page | 124 |
| Starting Page | 117 |
| ISSN | 00221295 |
| e-ISSN | 14611570 |
| DOI | 10.1112/s1461157000000243 |
| Journal | LMS Journal of Computation and Mathematics |
| Volume Number | 3 |
| Language | English |
| Publisher | Wiley-Blackwell |
| Publisher Date | 2000-01-01 |
| Access Restriction | Open |
| Subject Keyword | Journal: LMS Journal of Computation and Mathematics Unlabelled Subtrees Sub Trees Computational Difficulty |
| Content Type | Text |
| Resource Type | Article |
| Subject | Physiology |