Revision as of 17:59, 7 September 2011 edit Octahedron80 (talk \| contribs) Extended confirmed users 6,873 edits No edit summary ← Previous edit		Revision as of 03:49, 27 September 2011 edit undo Citation bot 1 (talk \| contribs) Bots 130,044 edits m [Pu405]Add: issn, issue. Tweak: issue. You can use this bot yourself. Report bugs here. Next edit →
Line 40: {{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]] \| 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. {{citation\|first=Donald B.\|last=Johnson\|authorlink=Donald B. Johnson\|title=Efficient algorithms for shortest paths in sparse networks\|journal=[[Journal of the ACM]]\|volume=24\|issue=1\|pages=1–13\|year=1977\|doi=10.1145/321992.321993}}. *{{citation\|first=J. W.\|last=Suurballe\|title=Disjoint paths in a network\|journal=Networks\|volume=14\|pages=125–145\|year=1974\|doi=10.1002/net.3230040204\|issue=2}}. == External links ==

Johnson's algorithm: Difference between revisions