Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Amir Abboud, Robert Krauthgamer, Ohad Trabelsi. New Algorithms and Lower Bounds for All-Pairs Max-Flow in Undirected Graphs. Theory of Computing, 17:1-27, 2021. [doi]
Possibly Related PublicationsThe following publications are possibly variants of this publication: New Algorithms and Lower Bounds for All-Pairs Max-Flow in Undirected GraphsAmir Abboud, Robert Krauthgamer, Ohad Trabelsi. soda 2020: 48-61 [doi] Conditional Lower Bounds for All-Pairs Max-FlowRobert Krauthgamer, Ohad Trabelsi. icalp 2017: [doi] Conditional Lower Bounds for All-Pairs Max-FlowRobert Krauthgamer, Ohad Trabelsi. TALG, 14(4), 2018. [doi]
The following publications are possibly variants of this publication: