The Library
Counting unlabelled subtrees of a tree is #P-complete
Tools
Goldberg, Leslie Ann and Jerrum, Mark (1999) Counting unlabelled subtrees of a tree is #P-complete. University of Warwick. Department of Computer Science. (Department of Computer Science research report). (Unpublished)
|
PDF (Department of Computer Science Research Report)
WRAP_cs-rr-364.pdf - Other - Requires a PDF viewer. Download (272Kb) | Preview |
Abstract
The problem of counting unlabelled subtrees of a tree (i.e., subtrees that are distinct up to isomorphism) is #P-complete, and hence equivalent in computational difficulty to evaluating the permanent of a 0,1-matrix.
Item Type: | Report | ||||
---|---|---|---|---|---|
Subjects: | Q Science > QA Mathematics | ||||
Divisions: | Faculty of Science, Engineering and Medicine > Science > Computer Science | ||||
Library of Congress Subject Headings (LCSH): | Graph theory | ||||
Series Name: | Department of Computer Science research report | ||||
Publisher: | University of Warwick. Department of Computer Science | ||||
Official Date: | 26 November 1999 | ||||
Dates: |
|
||||
Number: | Number 364 | ||||
Number of Pages: | 9 | ||||
DOI: | CS-RR-364 | ||||
Institution: | University of Warwick | ||||
Theses Department: | Department of Computer Science | ||||
Status: | Not Peer Reviewed | ||||
Publication Status: | Unpublished | ||||
Funder: | European Strategic Programme of Research and Development in Information Technology (ESPRIT), Engineering and Physical Sciences Research Council (EPSRC) | ||||
Grant number: | 21726 "RAND2" (ESPRIT), GR/L60982 (EPSRC) | ||||
Related URLs: |
Request changes or add full text files to a record
Repository staff actions (login required)
View Item |
Downloads
Downloads per month over past year