An efficient algorithm to determine all shortest paths in Sierpiński graphs.

Andreas M. Hinz Caroline Holz auf der Heide

Published in: Discret. Appl. Math. (2014)

Keyphrases

shortest path
finding the shortest path
shortest path problem
dynamic programming
strongly connected components
shortest path algorithm
np hard
minimum cost flow
optimal path
spanning tree
shortest distance
optimal solution
edge weights
weighted graph
flow graph
graph theory
mobile robot