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- DISTRIBUTED, PARALLEL, AND CLUSTER COMPUTING

- DATA STRUCTURES AND ALGORITHMS