By Topic

An Algorithm to Find the kth Shortest Path in Halin Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Yunting Lu ; Shenzhen Inst. of Inf. Technol., Shenzhen ; Zhenjun Li

K shortest path problem finds the kth shortest path from the source node to the destination node. Itpsilas known that the k shortest path problem is NP-complete. In this paper, we restrict the problem in Halin Networks and give an algorithm to find the kth shortest paths. The time complexity is O(k3|V|).

Published in:

Intelligent Information Technology Application Workshops, 2008. IITAW '08. International Symposium on

Date of Conference:

21-22 Dec. 2008