Beeping Shortest Paths via Hypergraph Bipartite Decomposition.
Fabien DufoulonYuval EmekRan GellesPublished in: ITCS (2023)
Keyphrases
- shortest path
- shortest path algorithm
- vertex set
- shortest path problem
- strongly connected components
- weighted graph
- road network
- edge weights
- path length
- optimal path
- finding the shortest path
- flow graph
- bipartite graph
- travel time
- graph model
- mobile robot
- minimum cost flow
- pairwise
- information flow
- active contours
- shortest distance
- dynamic programming