Approximating the Maximally Balanced Connected Partition Problem in graphs (Q673224)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Approximating the Maximally Balanced Connected Partition Problem in graphs |
scientific article; zbMATH DE number 985452
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximating the Maximally Balanced Connected Partition Problem in graphs |
scientific article; zbMATH DE number 985452 |
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
0.8912315964698792
0 references
0.887282133102417
0 references
0.8841381669044495
0 references
0.8652489185333252
0 references
0.8603522181510925
0 references
