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: CoRR (2023)
Keyphrases
- minimum cost flow
- shortest path
- shortest path algorithm
- strongly connected components
- shortest path problem
- weighted graph
- bi objective
- road network
- finding the shortest path
- minimum cost
- graph search
- path length
- edge weights
- flow graph
- routing problem
- routing algorithm
- optimal path
- minimum spanning tree
- social networks
- travel time
- graph theory
- fitness function
- objective function