Browsing College of Computing Technical Reports by Subject "Gap relabeling heuristic"
Now showing items 1-1 of 1
A Cache-Aware Parallel Implementation of the Push-Relabel Network Flow Algorithm and Experimental Evaluation of the Gap Relabeling Heuristic (Georgia Institute of Technology, 2006-02-25)The maximum flow problem is a combinatorial problem of significant importance in a wide variety of research and commercial applications. It has been extensively studied and implemented over the past 40 years. The ...