On the complexity of partitioning a graph into a few connected subgraphs (Q2352361): 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.1007/s10878-013-9642-8 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1988680402 / rank | |||
Normal rank | |||
Revision as of 02:30, 20 March 2024
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
