Content deleted Content added
m →Algorithm: move comments to seperate line |
Citation bot (talk | contribs) Add: publisher. | Use this bot. Report bugs. | Suggested by Abductive | Category:Graph distance | #UCB_Category 1/15 |
||
Line 197:
| title = Flows in Networks
| year = 1962}}
*{{Cite book|first1=Jørgen |last1=Bang-Jensen|first2=Gregory|last2=Gutin|year=2000|title=Digraphs: Theory, Algorithms and Applications|edition=First |isbn=978-1-84800-997-4|chapter=Section 2.3.4: The Bellman-Ford-Moore algorithm|publisher=Springer |url=http://www.cs.rhul.ac.uk/books/dbook/}}
*{{cite journal|first=Alexander|last=Schrijver|title=On the history of combinatorial optimization (till 1960)|pages=1–68|publisher=Elsevier|journal=Handbook of Discrete Optimization|year=2005|url=http://homepages.cwi.nl/~lex/files/histco.pdf}}
*{{Introduction to Algorithms}}, Second Edition. MIT Press and McGraw-Hill, 2001. {{ISBN|0-262-03293-7}}. Section 24.1: The Bellman–Ford algorithm, pp. 588–592. Problem 24–1, pp. 614–615. Third Edition. MIT Press, 2009. {{ISBN|978-0-262-53305-8}}. Section 24.1: The Bellman–Ford algorithm, pp. 651–655.
| |||