Revision as of 01:19, 31 August 2015 edit Lowercase sigmabot III (talk \| contribs) Bots, Page movers 2,448,787 edits m Archiving 14 discussion(s) to Talk:Bellman–Ford algorithm/Archive 3) (bot ← Previous edit		Revision as of 21:26, 2 April 2019 edit undo Mdmi (talk \| contribs) 196 edits →Improvement to Yen's improvement Next edit →
Line 67: Re the "Yen's improvement" section of our article: an additional improvement by a factor of 2/3 may be obtained by choosing the linear ordering of the vertices randomly rather than arbitrarily. See {{citation\|contribution=Randomized speedup of the Bellman–Ford algorithm\|first1=M. J.\|last1=Bannister\|first2=D.\|last2=Eppstein\|author2-link=David Eppstein\|arxiv=1111.5414\|title=Analytic Algorithmics and Combinatorics (ANALCO12), Kyoto, Japan\|year=2012\|pages=41–47\|url=http://siam.omnibooksonline.com/2012ANALCO/data/papers/005.pdf}}. I'm leaving this note here rather than adding the reference myself because of the obvious conflict of interest. —[[User:David Eppstein\|David Eppstein]] ([[User talk:David Eppstein\|talk]]) 03:00, 10 December 2012 (UTC) == Pop up shortest-path figure == The "shortest path" link in the first sentence pops up a figure whose caption refers to edge weights, yet the figure doesn't show any. [[User:Mdmi\|Mdmi]] ([[User talk:Mdmi\|talk]]) 21:25, 2 April 2019 (UTC)

Talk:Bellman–Ford algorithm: Difference between revisions