Partitioning a graph into minimum gap components (Q510915)
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: Partitioning a graph into minimum gap components |
scientific article; zbMATH DE number 6684433
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Partitioning a graph into minimum gap components |
scientific article; zbMATH DE number 6684433 |
Statements
Partitioning a graph into minimum gap components (English)
0 references
14 February 2017
0 references
graph partitioning
0 references
computational complexity
0 references
approximability
0 references
0.9285108
0 references
0.9207207
0 references
0.91421664
0 references
0.91421664
0 references
0.91358674
0 references
0 references
0.9063337
0 references
