On the complexity of partitioning a graph into a few connected subgraphs (Q2352361): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Decomposable trees: A polynomial algorithm for tripodes / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A degree bound on decomposable trees / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Partitioning powers of traceable or Hamiltonian graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the complexity of partitioning graphs into connected subgraphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Approximation Algorithms for Min–Max Tree Partition / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A homology theory for spanning tress of a graph / rank | |||
Normal rank | |||
Latest revision as of 10:43, 10 July 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
