Johnson's algorithm: Difference between revisions

Revision as of 22:39, 27 January 2006

Revision as of 22:09, 4 March 2006

Line 8:

==References==

* Donald B. Johnson. Efficient algorithms for shortest paths in sparse networks. ''[[Journal of the ACM]]'' 24(1):1–13, January 1977. {{doi|10.1145/321992.321993}}

*{{Webcite referenceweb | title=Johnson's Algorithm | work=AUTHOR(S), "Johnson's algorithm", from Dictionary of Algorithms and Data Structures, Paul E. Black, ed., NIST. | URLurl=http://www.nist.gov/dads/HTML/johnsonsAlgorithm.html | dateaccessdate=14 June | yearaccessyear=2005 }}

[[Category:Graph algorithms]]