A distributed mincut/maxflow algorithm combining path augmentation and push-relabel (Q2254255)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6397368
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A distributed mincut/maxflow algorithm combining path augmentation and push-relabel |
scientific article; zbMATH DE number 6397368 |
Statements
A distributed mincut/maxflow algorithm combining path augmentation and push-relabel (English)
0 references
4 February 2015
0 references
maximum flow
0 references
minimum cut
0 references
distributed algorithm
0 references
parallel algorithm
0 references
push-relable
0 references
augmenting path
0 references
large scale
0 references
0.7681037783622742
0 references
0.7604923844337463
0 references
0.7604700326919556
0 references
0.7584536075592041
0 references
