Maximum flow and minimum-cost flow in almost-linear time
We give an algorithm that computes exact maximum flows and minimum-cost flows on
directed graphs with m edges and polynomially bounded integral demands, costs, and …
directed graphs with m edges and polynomially bounded integral demands, costs, and …
Universally-optimal distributed exact min-cut
M Ghaffari, G Zuzic - Proceedings of the 2022 ACM Symposium on …, 2022 - dl.acm.org
We present a universally-optimal distributed algorithm for the exact weighted min-cut. The
algorithm is guaranteed to complete in Õ (D+√ n) rounds on every graph, recovering the …
algorithm is guaranteed to complete in Õ (D+√ n) rounds on every graph, recovering the …
Fast algorithms via dynamic-oracle matroids
We initiate the study of matroid problems in a new oracle model called dynamic oracle. Our
algorithms in this model lead to new bounds for some classic problems, and a “unified” …
algorithms in this model lead to new bounds for some classic problems, and a “unified” …
Almost-linear-time algorithms for maximum flow and minimum-cost flow
We present an algorithm that computes exact maximum flows and minimum-cost flows on
directed graphs with m edges and polynomially bounded integral demands, costs, and …
directed graphs with m edges and polynomially bounded integral demands, costs, and …
Maximal k-Edge-Connected Subgraphs in Weighted Graphs via Local Random Contraction
C Nalam, T Saranurak - Proceedings of the 2023 Annual ACM-SIAM …, 2023 - SIAM
The maximal k-edge-connected subgraphs problem is a classical graph clustering problem
studied since the 70's. Surprisingly, no non-trivial technique for this problem in weighted …
studied since the 70's. Surprisingly, no non-trivial technique for this problem in weighted …
Max-flow min-cut theorem in quantum computing
The max-flow min-cut theorem in graph theory states that the maximum flow of a network is
equal to the minimum cut of edges of the flow network. Max-flow and min-cut are related as …
equal to the minimum cut of edges of the flow network. Max-flow and min-cut are related as …
Maximum Flow by Augmenting Paths in Time
We present a combinatorial algorithm for computing exact maximum flows in directed graphs
with $ n $ vertices and edge capacities from $\{1,\dots, U\} $ in $ n^{2+ o (1)}\log U $ time …
with $ n $ vertices and edge capacities from $\{1,\dots, U\} $ in $ n^{2+ o (1)}\log U $ time …
Graph Algorithms: Cuts, Flows, and Network Design (Dagstuhl Seminar 23422)
This report documents the program and the outcomes of Dagstuhl Seminar 23422" Graph
Algorithms: Cuts, Flows, and Network Design". This seminar brought 25 leading researchers …
Algorithms: Cuts, Flows, and Network Design". This seminar brought 25 leading researchers …
[HTML][HTML] Almost-Linear-Time Algorithms for Maximum Flow and Minimum-Cost Flow We present an algorithm that computes exact maximum flows and minimum-cost …
We present an algorithm that computes exact maximum flows and minimum-cost flows on
directed graphs with m edges and polynomially bounded integral demands, costs, and …
directed graphs with m edges and polynomially bounded integral demands, costs, and …