Minimum Cuts in Directed Graphs via $\sqrt{n}$ Max-Flows
Data Structures and Algorithms
2021-04-19 v1
Abstract
We give an algorithm to find a mincut in an -vertex, -edge weighted directed graph using calls to any maxflow subroutine. Using state of the art maxflow algorithms, this yields a directed mincut algorithm that runs in time. This improves on the 30 year old bound of obtained by Hao and Orlin for this problem.
Cite
@article{arxiv.2104.07898,
title = {Minimum Cuts in Directed Graphs via $\sqrt{n}$ Max-Flows},
author = {Ruoxu Cen and Jason Li and Danupon Nanongkai and Debmalya Panigrahi and Thatchaphol Saranurak},
journal= {arXiv preprint arXiv:2104.07898},
year = {2021}
}