Almost-Linear Time Algorithms for Incremental Graphs: Cycle Detection, SCCs, s-t Shortest Path, and Minimum-Cost Flow.
Li ChenRasmus KyngYang P. LiuSimon MeierhansMaximilian Probst GutenbergPublished in: STOC (2024)
Keyphrases
- minimum cost flow
- shortest path
- shortest path algorithm
- strongly connected components
- weighted graph
- routing algorithm
- bi objective
- minimum cost
- edge weights
- finding the shortest path
- minimum spanning tree
- evolutionary algorithm
- test problems
- graph theory
- road network
- shortest distance
- optimal path
- path length
- graph search
- worst case
- multi objective