Finding Simple Shortest-Paths via Centroids
Centroids are used to compute an arbitrary number of simple paths with some important benefits: the expansion of a single centroid delivers an arbitrary number of paths; only a single Dijk-stra search is required to complete the task; the same algorithm can be easily coupled with heuristics that improve search efficiency.
Carlos Linares L´opez, I. Herman
· 0 citations