Algorithm 1002: Graph coloring based parallel push-relabel algorithm for the maximum flow problem (Q4960971)
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: Algorithm 1002: Graph coloring based parallel push-relabel algorithm for the maximum flow problem |
scientific article; zbMATH DE number 7193395
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithm 1002: Graph coloring based parallel push-relabel algorithm for the maximum flow problem |
scientific article; zbMATH DE number 7193395 |
Statements
Algorithm 1002 (English)
0 references
24 April 2020
0 references
minimum cut problem
0 references
preflow-push algorithm
0 references
vertex coloring
0 references
0.8213075399398804
0 references
0.8093469142913818
0 references
0.8022834658622742
0 references
0.7968594431877136
0 references
