A distributed mincut/maxflow algorithm combining path augmentation and push-relabel
From MaRDI portal
Publication:2254255
DOI10.1007/s11263-012-0571-2zbMath1319.68223arXiv1109.1146MaRDI QIDQ2254255
Václav Hlaváč, Alexander Shekhovtsov
Publication date: 4 February 2015
Published in: International Journal of Computer Vision (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1109.1146
minimum cut; parallel algorithm; distributed algorithm; maximum flow; augmenting path; large scale; push-relable
90C27: Combinatorial optimization
68T45: Machine vision and scene understanding
68W15: Distributed algorithms
Related Items
TBGMax: leveraging two-boundary graph pattern for lossless maximum-flow acceleration, Composability and controllability of structural linear time-invariant systems: distributed verification
Uses Software
Cites Work