Two-Level Push-Relabel Algorithm for the Maximum Flow Problem-Reference-Cited by-同舟云学术

Two-Level Push-Relabel Algorithm for the Maximum Flow Problem

Published:2009 Issue: Volume: Page:212-225
ISSN:0302-9743
Container-title:Algorithmic Aspects in Information and Management
language:
Short-container-title:

Author:

Goldberg Andrew V.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-02158-9_19

Reference27 articles.

1. Ahuja, R.K., Orlin, J.B., Stein, C., Tarjan, R.E.: Improved algorithms for bipartite network flow problems. SIAM J. Comp. (to appear)

2. Lecture Notes in Computer Science;M. Babenko,2007

3. Boykov, Y., Kolmogorov, V.: An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Vision. IEEE transactions on Pattern Analysis and Machine Intelligence 26(9), 1124–1137 (2004)

4. Chandran, B., Hochbaum, D.: A computational study of the pseudoflow and push-relabel algorithms for the maximum flow problem (submitted for publication) (2007)

5. Cheriyan, J., Maheshwari, S.N.: Analysis of Preflow Push Algorithms for Maximum Network Flow. SIAM J. Comput. 18, 1057–1086 (1989)

Cited by 33 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Critical nematic correlations throughout the superconducting doping range in Bi2−zPbzSr2−yLayCuO6+x;Nature Communications;2023-05-05

2. Review of Serial and Parallel Min-Cut/Max-Flow Algorithms for Computer Vision;IEEE Transactions on Pattern Analysis and Machine Intelligence;2023-02-01

3. Global suppression heuristic: fast GraphCut in GPU for image stitching;Signal, Image and Video Processing;2023-01-24

4. Enhanced instance space analysis for the maximum flow problem;European Journal of Operational Research;2023-01

5. Efficient Heuristic Algorithm to Speed up GraphCut in GPU for Image Stitching;2022 IEEE 13th International Symposium on Parallel Architectures, Algorithms and Programming (PAAP);2022-11-25