Approximating the Maximally Balanced Connected Partition Problem in graphs (Q673224): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A short note on the approximability of the maximum leaves spanning tree problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The complexity of restricted spanning tree problems / rank | |||
Normal rank | |||
Latest revision as of 11:24, 27 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximating the Maximally Balanced Connected Partition Problem in graphs |
scientific article |
Statements
Approximating the Maximally Balanced Connected Partition Problem in graphs (English)
0 references
28 February 1997
0 references
Analysis of algorithms
0 references
Combinatorial problems
0 references
Connected graphs
0 references
