Subject
Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science
Reference21 articles.
1. Flow Algorithms;Adel'son-Vel'ski,1985
2. A fast and simple algorithm for the maximum flow problem;Ahuja,1987
3. The parallel evaluation of general arithmetic expressions;Brent;J. Assoc. Comput. Match.,1974
4. Analysis of preflow push algorithms for maximum network flow;Cheriyan;SIAM J. Comput.,1989
5. Parallel merge sort;Cole;Proc. 27th IEEE Ann. Symp. on Foundations of Computer Science,1986
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Review of Serial and Parallel Min-Cut/Max-Flow Algorithms for Computer Vision;IEEE Transactions on Pattern Analysis and Machine Intelligence;2023-02-01
2. Faster Multi-Object Segmentation using Parallel Quadratic Pseudo-Boolean Optimization;2021 IEEE/CVF International Conference on Computer Vision (ICCV);2021-10
3. A Hybrid Parallel Implementation for the Maximum Flow Problem;2018 26th Euromicro International Conference on Parallel, Distributed and Network-based Processing (PDP);2018-03
4. Dynamic Parallel and Distributed Graph Cuts;IEEE Transactions on Image Processing;2016-12
5. A Distributed Mincut/Maxflow Algorithm Combining Path Augmentation and Push-Relabel;International Journal of Computer Vision;2012-09-22