Login / Signup

About the shortest chain between two vertices in a quasi strongly connected digraph with a potential.

Jean-Pierre Barthélemy
Published in: Discret. Math. (1981)
Keyphrases
  • strongly connected
  • directed graph
  • shortest path
  • undirected graph
  • real time
  • optimum path forest
  • case study