The complexity of counting homeomorphs (Q1058852): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0304-3975(85)90053-2 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2093763335 / rank | |||
Normal rank | |||
Revision as of 19:41, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of counting homeomorphs |
scientific article |
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
