Title: A Practical Algorithm for Finding the Shortest Kth Path Based on Deviation Path
Abstract: Based on the concept of deviation path,a practical algorithm was designed for finding the shortest Kth path.By deviating path from the(K-1)th shortest path,this algorithm can get the shortest Kth path.The time complexity of this algorithm is limited by O(e×n2),while e is the total number edges of a topology.This algorithm has good prospects in the real-time application.
Publication Year: 2009
Publication Date: 2009-01-01
Language: en
Type: article
Access and Citation
Cited By Count: 2
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot