Revision as of 02:27, 21 May 2025 edit David Eppstein (talk \| contribs) Autopatrolled, Administrators 235,723 edits →Original sources: fix title ← Previous edit		Revision as of 02:29, 21 May 2025 edit undo David Eppstein (talk \| contribs) Autopatrolled, Administrators 235,723 edits →Original sources: cite conference version, not preprint Next edit →
Line 188: }} {{cite conference\|title=Randomized speedup of the Bellman–Ford algorithm\|first1=M. J.\|last1=Bannister\|first2=D.\|last2=Eppstein\|author2-link=David Eppstein\|arxiv=1111.5414\|conference=Analytic Algorithmics and Combinatorics (ANALCO12), Kyoto, Japan\|year=2012\|pages=41–47\|doi=10.1137/1.9781611973020.6}} {{cite conference *{{cite conference\|title=Single-Source Shortest Paths with Negative Real Weights in <math>\tilde O(mn^{8/9})</math> Time\|first=Jeremy\|last=Fineman\|arxiv=2311.02520\|year=2023}} \| last = Fineman \| first = Jeremy T. \| editor1-last = Mohar \| editor1-first = Bojan \| editor2-last = Shinkar \| editor2-first = Igor \| editor3-last = O'Donnell \| editor3-first = Ryan \| arxiv = 2311.02520 \| contribution = Single-source shortest paths with negative real weights in <math>\tilde O(mn^{8/9})</math> time \| doi = 10.1145/3618260.3649614 \| pages = 3–14 \| publisher = Association for Computing Machinery \| title = Proceedings of the 56th Annual ACM Symposium on Theory of Computing, STOC 2024, Vancouver, BC, Canada, June 24–28, 2024 \| year = 2024}} === Secondary sources ===

Bellman–Ford algorithm: Difference between revisions