Sign in

Fast shortest-paths algorithms in the presence of few destinations of negative-weight arcs.

Domenico CantoneSimone Faro
Published in: J. Discrete Algorithms (2014)
Keyphrases
  • shortest path
  • shortest path algorithm
  • minimum cost flow
  • random walk
  • strongly connected components
  • distance measure
  • graph theory
  • weighted graph