A Nearly Optimal All-Pairs Min-Cuts Algorithm in Simple Graphs-Reference-Cited by-同舟云学术

A Nearly Optimal All-Pairs Min-Cuts Algorithm in Simple Graphs

Published:2022-02 Issue: Volume: Page:
ISSN:
Container-title:2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS)
language:
Short-container-title:

Author:

Li Jason¹,Panigrahi Debmalya²,Saranurak Thatchaphol³

Affiliation:

1. Simons Institute, UC,Berkeley

2. Duke University,Department of Computer Science

3. University of Michigan,Computer Science & Engineering Division,Ann Arbor

Funder

NSF

ARO

Publisher

IEEE

Link

http://xplorestaging.ieee.org/ielx7/9719594/9719683/09719859.pdf?arnumber=9719859

Reference22 articles.

1. Multi-Terminal Network Flows

2. Very Simple Methods for All Pairs Network Flow Analysis

3. Efficient algorithms for computing all low s-t edge connectivities and related problems;hariharan;Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms SODA 2007,2007

4. Fast Augmenting Paths by Random Sampling from Residual Graphs

5. Unit Capacity Maxflow in Almost Time

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. An optimal pruned traversal tree-based fast minimum cut solver in dense graph;Information Sciences;2024-01

2. All-Pairs Max-Flow is no Harder than Single-Pair Max-Flow: Gomory-Hu Trees in Almost-Linear Time;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06

3. Tight Conditional Lower Bounds for Vertex Connectivity Problems;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02

4. Fast Algorithms via Dynamic-Oracle Matroids;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02

5. Optimal pruned tree-cut mapping-based fast shielding for large-scale networks;Chaos, Solitons & Fractals;2023-05