A heuristic method for solving the problem of partitioning graphs with supply and demand (Q256649)
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: A heuristic method for solving the problem of partitioning graphs with supply and demand |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A heuristic method for solving the problem of partitioning graphs with supply and demand |
scientific article |
Statements
A heuristic method for solving the problem of partitioning graphs with supply and demand (English)
0 references
9 March 2016
0 references
graph partitioning
0 references
greedy algorithm
0 references
demand node
0 references
supply node
0 references
0.8272815942764282
0 references
0.7828421592712402
0 references
0.7646148204803467
0 references
0.751227855682373
0 references
0.7462542057037354
0 references
