Dynamically tuned push-relabel algorithm for the maximum flow problem on CPU-GPU-Hybrid platforms

  • Zhengyu He, Bo Hong
  • Published 2010 in
    2010 IEEE International Symposium on Parallel…


The maximum flow problem is a fundamental graph theory problem with many important applications. Max-flow algorithms based on the push-relabel method are known to have better complexity bound and faster practical execution speed than others. However, existing push-relabel algorithms are designed for uniprocessors or parallel processors that support locking… (More)
DOI: 10.1109/IPDPS.2010.5470401


7 Figures and Tables


Citations per Year

Citation Velocity: 7

Averaging 7 citations per year over the last 3 years.

Learn more about how we calculate this metric in our FAQ.