Experimental study of minimum cut algorithms

  • Chekuri C
  • Goldberg A
  • 52


    Mendeley users who have this article in their library.
  • 73


    Citations of this article.


Recently, several new algorithms have been developed for the minimum cut problem. These algorithms are very different from the earlier ones and from each other and substantially improve the worst-case time bounds for the problem. In this paper, we conduct experimental evaluation the relative performance of these algorithms. In the process, we develop heuristics and data structures that substantially improve the practical performance of the algorithms. We also develop problem families for testing minimum cut algorithms. Our work leads to a better understanding of the practical performance of minimum cut algorithms and produces very efficient codes for the problem.

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


  • Cs Chekuri

  • Av Goldberg

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free