The complexity of counting homeomorphs (Q1058852): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: The directed subgraph homeomorphism problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The node-deletion problem for hereditary properties is NP-complete / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4139697 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The complexity of computing the permanent / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Complexity of Enumeration and Reliability Problems / rank | |||
Normal rank | |||
Latest revision as of 17:50, 14 June 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
0 references
