Title: A New Polynomially Bounded Shortest Path Algorithm
Abstract: This paper develops a new polynomially bounded shortest path algorithm, called the partitioning shortest path (PSP) algorithm, for finding the shortest path from one node to all other nodes in a network containing no cycles with negative lengths. This new algorithm includes as variants the label setting algorithm, many of the label correcting algorithms, and the apparently computationally superior threshold algorithm.
Publication Year: 1985
Publication Date: 1985-02-01
Language: en
Type: article
Indexed In: ['crossref']
Access and Citation
Cited By Count: 116
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot