ScholarLens Back to search
2009•Computer Technology and DevelopmentRequires access

A Practical Algorithm for Finding the Shortest Kth Path Based on Deviation Path

Chen Jie

Open publisher page 2 citations

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.

About this research paper

What this paper is about

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.

Why it matters

OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available 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.

Key concepts: Yen's algorithm, K shortest path routing, Shortest path problem, Constrained Shortest Path First, Shortest Path Faster Algorithm, Computer science, Path (computing), Algorithm

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
A Practical Algorithm for Finding the Shortest Kth Path Based on Deviation Path — Research Paper | ScholarLens