Abstract: The shortest path problem is one of the most studied problems in computer science. In a previous paper[7], we suggested an algorithm(the Augmented Shortest Path Algorithm) for the solution of the single source shortest path problem in O(mk+n) time, where k, the ratio of maximum and minimum weights of the edges of the graph, is bounded by a constant, m is the number of edges and n is the number of vertices. In this paper, we propose an improvement.
Publication Year: 2002
Publication Date: 2002-01-01
Language: en
Type: article
Access and Citation
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot