All-Pairs Max-Flow is no Harder than Single-Pair Max-Flow: Gomory-Hu Trees in Almost-Linear Time

Abboud, Amir; Li, Jason; Panigrahi, Debmalya; Saranurak, Thatchaphol

doi:10.1109/focs57990.2023.00137

2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS) 2023

DOI: 10.1109/focs57990.2023.00137

|View full text |Cite

All-Pairs Max-Flow is no Harder than Single-Pair Max-Flow: Gomory-Hu Trees in Almost-Linear Time

Amir Abboud,

Jason Li,

Debmalya Panigrahi

et al.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2024

Publication Types

Select...

Other3

Relationship

Self Cite0

Independent3

Authors

Journals

Cited by 3 publications

References 54 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

Computing the 3-Edge-Connected Components of Directed Graphs in Linear Time

Georgiadis,

Italiano,

Kosinas

2024

2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS)

View full text Add to dashboard Cite

Computing the 3-Edge-Connected Components of Directed Graphs in Linear Time

Georgiadis,

Italiano,

Kosinas

2024

2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS)

View full text Add to dashboard Cite

Maximum Flow by Augmenting Paths in $n^{2+o(1)}$ Time

Bernstein,

Blikstad,

Saranurak

et al. 2024

2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS)

View full text Add to dashboard Cite

A Dynamic Shortest Paths Toolbox: Low-Congestion Vertex Sparsifiers and Their Applications

Kyng,

Meierhans,

Probst Gutenberg

2024

Proceedings of the 56th Annual ACM Symposium on Theory of Computing

View full text Add to dashboard Cite

scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.

Contact Info

customersupport@researchsolutions.com

10624 S. Eastern Ave., Ste. A-614

Henderson, NV 89052, USA

This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.

Blog Terms and Conditions API Terms Privacy Policy Contact Cookie Preferences Do Not Sell or Share My Personal Information

Made with 💙 for researchers

Part of the Research Solutions Family.

All-Pairs Max-Flow is no Harder than Single-Pair Max-Flow: Gomory-Hu Trees in Almost-Linear Time

Cited by 3 publications

References 54 publications

Computing the 3-Edge-Connected Components of Directed Graphs in Linear Time

Computing the 3-Edge-Connected Components of Directed Graphs in Linear Time

Maximum Flow by Augmenting Paths in $n^{2+o(1)}$ Time

A Dynamic Shortest Paths Toolbox: Low-Congestion Vertex Sparsifiers and Their Applications

Contact Info

Product

Resources

About