On the complexity of partitioning a graph into a few connected subgraphs (Q2352361)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of partitioning a graph into a few connected subgraphs |
scientific article |
Statements
On the complexity of partitioning a graph into a few connected subgraphs (English)
0 references
1 July 2015
0 references
arbitrarily partitionable graphs
0 references
partition into connected subgraphs
0 references
partition under vertex prescriptions
0 references
complexity
0 references
polynomial hierarchy
0 references
