"Almost-Linear Time Algorithms for Decremental Graphs: Min-Cost Flow and ..."

Jan van den Brand et al. (2024)

> Home

Details and statistics

DOI: 10.1109/FOCS61266.2024.00120

access: closed

type: Conference or Workshop Paper

metadata version: 2024-12-09

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/focs/Brand0KLMGS24
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/focs/Brand0KLMGS24
Jan van den Brand, Li Chen, Rasmus Kyng, Yang P. Liu, Simon Meierhans, Maximilian Probst Gutenberg, Sushant Sachdeva:
Almost-Linear Time Algorithms for Decremental Graphs: Min-Cost Flow and More via Duality. FOCS 2024: 2010-2032

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.