We give a deterministic (global) min-cut algorithm for weighted undirected graphs that runs
in time O (m 1+ ε) plus polylog (n) max-flow computations. Using the current best max-flow …

In 1961, Gomory and Hu showed that the All-Pairs Max-Flow problem of computing the max-
flow between all n\2 pairs of vertices in an undirected graph can be solved using only n-1 …

We settle the complexities of the maximum-cardinality bipartite matching problem (BMM) up
to polylogarithmic factors in five models of computation: the two-party communication, AND …

We study the complexity of determining the edge connectivity of a simple graph with cut
queries. We show that (i) there is a bounded-error randomized algorithm that computes …

We devise new cut sparsifiers that are related to the classical sparsification of Nagamochi
and Ibaraki [Algorithmica, 1992], which is an algorithm that, given an unweighted graph G on …

We introduce the notion of fair cuts as an approach to leverage approximate (s, t)-mincut
(equivalently (s, t)-maxflow) algorithms in undirected graphs to obtain near-linear time …

Abstract In the Hedge Cut problem, the edges of a graph are partitioned into groups called
hedges, and the question is what is the minimum number of hedges to delete to disconnect …

In this paper we describe a randomized algorithm which returns a maximal spanning forest
of an unknown {\em weighted} undirected graph making $ O (n) $$\mathsf {CUT} $ queries …

Unbreakable decomposition, introduced by [CLP+ 19, CKL+ 20], has proven to be one of the
most powerful tools for parameterized graph cut problems in recent years. Unfortunately, all …

A cactus representation of a graph, introduced by Dinitz et al. in 1976, is an edge sparsifier
of O (n) size that exactly captures all global minimum cuts of the graph. It is a central …