Approximating the Maximally Balanced Connected Partition Problem in graphs (Q673224): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 10:21, 30 January 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
