• search
    search
  • reviewers
    reviewers
  • feeds
    feeds
  • assignments
    assignments
  • settings
  • logout

)-shortest paths via minor-aggregates: near-optimal deterministic parallel and distributed algorithms.

Václav RozhonChristoph GrunauBernhard HaeuplerGoran ZuzicJason Li
Published in: STOC (2022)
Keyphrases
  • shortest path
  • shortest path algorithm
  • minimum cost flow
  • data streams
  • weighted graph
  • travel time
  • optimal path