The complexity of counting homeomorphs (Q1058852)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3902036
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of counting homeomorphs |
scientific article; zbMATH DE number 3902036 |
Statements
The complexity of counting homeomorphs (English)
0 references
1985
0 references
In this note we show that, for any finite nontrivial family \({\mathcal H}\) of graphs, the problem of finding the number of subgraphs of a graph which are homeomorphic from a member of \({\mathcal H}\) is {\#}P-complete. From this it follows that the problems of counting the paths, circuits, or minimal nonplanar subgraphs of a graph are all {\#}P-complete.
0 references
sharp-P-completeness
0 references
number of subgraphs
0 references
paths
0 references
circuits
0 references
minimal nonplanar subgraphs
0 references
0 references
0.8256064653396606
0 references
0.7938709855079651
0 references
0.7737429141998291
0 references
