Niklas Baumstark

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
Based on the observation that FIFO-based push-relabel algorithms are able to outperform highest label-based variants on modern, large maximum flow problem instances, we introduce an efficient implementation of the algorithm that uses coarse-grained parallelism to avoid the problems of existing parallel approaches. We demonstrate good relative and absolute(More)
  • 1