Minimum Cuts in Directed Graphs via Partial Sparsification

11/17/2021
by   Ruoxu Cen, et al.
0

We give an algorithm to find a minimum cut in an edge-weighted directed graph with n vertices and m edges in Õ(n·max(m^2/3, n)) time. This improves on the 30 year old bound of Õ(nm) obtained by Hao and Orlin for this problem. Our main technique is to reduce the directed mincut problem to Õ(min(n/m^1/3, √(n))) calls of any maxflow subroutine. Using state-of-the-art maxflow algorithms, this yields the above running time. Our techniques also yield fast approximation algorithms for finding minimum cuts in directed graphs. For both edge and vertex weighted graphs, we give (1+ϵ)-approximation algorithms that run in Õ(n^2 / ϵ^2) time.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

04/16/2021

Minimum Cuts in Directed Graphs via √(n) Max-Flows

We give an algorithm to find a mincut in an n-vertex, m-edge weighted di...
05/05/2018

An SDP Primal-Dual Approximation Algorithm for Directed Hypergraph Expansion and Sparsest Cut with Product Demands

We give approximation algorithms for the edge expansion and sparsest cut...
10/26/2015

Edge-Linear First-Order Dependency Parsing with Undirected Minimum Spanning Tree Inference

The run time complexity of state-of-the-art inference algorithms in grap...
07/22/2019

Direction Matters: On Influence-Preserving Graph Summarization and Max-cut Principle for Directed Graphs

Summarizing large-scaled directed graphs into small-scale representation...
04/14/2021

Fast Approximations for Rooted Connectivity in Weighted Directed Graphs

We consider approximations for computing minimum weighted cuts in direct...
08/06/2015

Universal Approximation of Edge Density in Large Graphs

In this paper, we present a novel way to summarize the structure of larg...
10/07/2021

Finding popular branchings in vertex-weighted digraphs

Popular matchings have been intensively studied recently as a relaxed co...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.