A Cache-Aware Parallel Implementation of the Push-Relabel Network Flow Algorithm and Experimental Evaluation of the Gap Relabeling Heuristic
ISCA PDCS, pp. 41-48, 2005.
The maximum flow problem is a combinatorial problem of significant importance in a wide va- riety of research and commercial applications. It has been extensively studied and implemented over the past 40 years. The push-relabel method has been shown to be superior to other methods, both in theoretical bounds and in experimental implementa...More
Full Text (Upload PDF)
PPT (Upload PPT)