A lock-free multi-threaded algorithm for the maximum flow problem

@article{Hong2008ALM,
  title={A lock-free multi-threaded algorithm for the maximum flow problem},
  author={Bo Hong},
  journal={2008 IEEE International Symposium on Parallel and Distributed Processing},
  year={2008},
  pages={1-8}
}
The maximum flow problem is an important graph problem with a wide range of applications. In this paper, we present a lock-free multi-threaded algorithm for this problem. The algorithm is based on the push-relabel algorithm proposed by Goldberg. By using re-designed push and relabel operations, we derive our algorithm that finds the maxi- mumflow with 0{\V\2 \E\) operations. We demonstrate that as long as a multi-processor architecture supports atomic 'read-update-write' operations, it will be… CONTINUE READING