"New Algorithms and Lower Bounds for All-Pairs Max-Flow in Undirected Graphs."

Amir Abboud, Robert Krauthgamer, Ohad Trabelsi (2020)

> Home

Details and statistics

DOI: 10.1137/1.9781611975994.4

access: open

type: Conference or Workshop Paper

metadata version: 2021-07-15

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/soda/AbboudKT20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/soda/AbboudKT20
Amir Abboud, Robert Krauthgamer, Ohad Trabelsi:
New Algorithms and Lower Bounds for All-Pairs Max-Flow in Undirected Graphs. SODA 2020: 48-61

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.