Thumbnail
Access Restriction
Subscribed

Author Minieka, Edward
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Keyword Graph ♦ Network ♦ Shortest path ♦ Algorithm
Abstract Two algorithms are presented that construct the k shortest paths between every pair of vertices in a directed graph. These algorithms generalize the Floyd algorithm and the Dantzig algorithm for finding the shortest path between every pair of vertices in a directed graph.
Description Affiliation: Univ. of Illinois, Chicago (Minieka, Edward)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 17
Issue Number 6
Page Count 3
Starting Page 351
Ending Page 353


Open content in new tab

   Open content in new tab
Source: ACM Digital Library