Revision as of 02:14, 8 November 2023 edit Lowercase sigmabot III (talk \| contribs) Bots, Page movers 2,448,355 edits m Archiving 1 discussion(s) to Talk:Bellman–Ford algorithm/Archive 1) (bot ← Previous edit		Revision as of 05:02, 8 November 2023 edit undo David Eppstein (talk \| contribs) Autopatrolled, Administrators 235,633 edits →New preprint: Reply Tag: Reply Next edit →
Line 82: Seems soon (after peer-review) there finally might be an improvement to this absolutely classical algorithm https://arxiv.org/abs/2311.02520 [[Special:Contributions/2A00:20:5:B593:5C8F:D801:68C2:458\|2A00:20:5:B593:5C8F:D801:68C2:458]] ([[User talk:2A00:20:5:B593:5C8F:D801:68C2:458\|talk]]) 00:29, 8 November 2023 (UTC) :Let's wait until it's at least been accepted to a conference before adding anything here. Anyway, the right place is [[Shortest path problem]], because it's a different algorithm than BF. —[[User:David Eppstein\|David Eppstein]] ([[User talk:David Eppstein\|talk]]) 05:02, 8 November 2023 (UTC)

Talk:Bellman–Ford algorithm: Difference between revisions