Removing Sequential Bottleneck of Dijkstra's Algorithm for the Shortest Path Problem

26 Dec 2018 Garg Vijay K.

All traditional methods of computing shortest paths depend upon edge-relaxation where the cost of reaching a vertex from a source vertex is possibly decreased if that edge is used. We introduce a method which maintains lower bounds as well as upper bounds for reaching a vertex... (read more)

PDF Abstract
No code implementations yet. Submit your code now

Categories


  • DISTRIBUTED, PARALLEL, AND CLUSTER COMPUTING
  • DATA STRUCTURES AND ALGORITHMS