Ruoxu Cen

activity

20202025

most citedMinimum Cuts in Directed Graphs via Partial Sparsification

2 citations · 3 across the 8 of their papers we have counts for

collaborators

Showing 2021Show all

3 papers · 1 filter

cs.DS2021★ 2 cited

Minimum Cuts in Directed Graphs via Partial Sparsification

Ruoxu Cen, Jason Li, Danupon Nanongkai +3

We give an algorithm to find a minimum cut in an edge-weighted directed graph with $n$ vertices and $m$ edges in $O ~ (n \cdot max (m^{2/3}, n))$ time. This improves on the 30 y…

cs.DS2021★ 1 cited

Augmenting Edge Connectivity via Isolating Cuts

Ruoxu Cen, Jason Li, Debmalya Panigrahi

We give an algorithm for augmenting the edge connectivity of an undirected graph by using the isolating cuts framework (Li and Panigrahi, FOCS '20). Our algorithm uses poly-logarit…

cs.DS2021

Minimum Cuts in Directed Graphs via $n$ Max-Flows

Ruoxu Cen, Jason Li, Danupon Nanongkai +2

We give an algorithm to find a mincut in an $n$ -vertex, $m$ -edge weighted directed graph using $O ~ (n)$ calls to any maxflow subroutine. Using state of the art maxflow…

Minimum Cuts in Directed Graphs via Partial Sparsification

Augmenting Edge Connectivity via Isolating Cuts

Minimum Cuts in Directed Graphs via n​ Max-Flows

Minimum Cuts in Directed Graphs via $n$ Max-Flows