"Almost-Linear Time Algorithms for Incremental Graphs: Cycle Detection, ..."

Li Chen et al. (2024)

> Home

Details and statistics

DOI: 10.1145/3618260.3649745

access: closed

type: Conference or Workshop Paper

metadata version: 2024-06-18

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/stoc/0028KLMG24
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/stoc/0028KLMG24
Li Chen, Rasmus Kyng, Yang P. Liu, Simon Meierhans, Maximilian Probst Gutenberg:
Almost-Linear Time Algorithms for Incremental Graphs: Cycle Detection, SCCs, s-t Shortest Path, and Minimum-Cost Flow. STOC 2024: 1165-1173

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.