Johnson's algorithm: Difference between revisions

Revision as of 22:07, 4 April 2008

Revision as of 22:18, 4 April 2008

Line 14:

==References==

* {{citation|first=Donald B. |last=Johnson. |title=Efficient algorithms for shortest paths in sparse networks. ''|journal=[[Journal of the ACM]]'' |volume=24(|issue=1):1–13, January |pages=1–13||year=1977. {{|doi|=10.1145/321992.321993}}.

*{{cite web | title=Johnson's Algorithm | work=Paul E. Black, "Johnson's algorithm", from Dictionary of Algorithms and Data Structures, Paul E. Black, ed., NIST. | url=http://www.nist.gov/dads/HTML/johnsonsAlgorithm.html | accessdaymonth=14 June | accessyear=2005 }}

*{{cite webcitation | titlecontribution=Johnson's Algorithm | workfirst=Paul E. |last=Black, "Johnson's algorithm", from |title=Dictionary of Algorithms and Data Structures,|publisher=[[National PaulInstitute E.of Black,Standards ed., NIST.and Technology]]| url=http://www.nist.gov/dads/HTML/johnsonsAlgorithm.html | accessdaymonth=14 June | accessyear=2005 }}.

*{{Citation | last1=Cormen | first1=Thomas H. | author1-link=Thomas H. Cormen | last2=Leiserson | first2=Charles E. | author2-link=Charles E. Leiserson | last3=Rivest | first3=Ronald L. | author3-link=Ronald L. Rivest | last4=Stein | first4=Clifford | author4-link=Clifford Stein | title=[[Introduction to Algorithms|Introduction to Algorithms]] | publisher=MIT Press and McGraw-Hill | isbn=978-0-262-03293-3 | year=2001}}. Section 25.3, "Johnson's algorithm for sparse graphs", pp. 636–640.