Access Restriction

Author Fox, B. L.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Keyword Networks ♦ Kth shortest paths
Abstract In a recent paper [4], Minieka proposes an algorithm for finding kth shortest paths between all pairs of nodes in an N node network. His claimed time is O(k2N3).
Description Affiliation: Univ. of Montreal, Montreal, Canada (Fox, B. L.)
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 18
Issue Number 5
Page Count 1
Starting Page 279
Ending Page 279

Open content in new tab

   Open content in new tab
Source: ACM Digital Library