Surpassing Dijkstra
-
The paper:
https://arxiv.org/html/2504.17033v2
Abstract:
Team in China came up with faster algorithm to find single-source shortest path. Before this, the fastest algorithm was developed by Dijkstra and published in 1984. Dijkstra’s name are in many Mathematics and Computer Science text books for this reason. I would venture to guess that anyone who has a Computer Science or Computer Engineering degree today knows Dijkstra’s name (though few will remember the algorithm itself). So surpassing Dijkstra’s algorithm after 41 years is a big deal.
-
The paper:
https://arxiv.org/html/2504.17033v2
Abstract:
Team in China came up with faster algorithm to find single-source shortest path. Before this, the fastest algorithm was developed by Dijkstra and published in 1984. Dijkstra’s name are in many Mathematics and Computer Science text books for this reason. I would venture to guess that anyone who has a Computer Science or Computer Engineering degree today knows Dijkstra’s name (though few will remember the algorithm itself). So surpassing Dijkstra’s algorithm after 41 years is a big deal.
@Axtremus said in Surpassing Dijkstra:
I would venture to guess that anyone who has a Computer Science or Computer Engineering degree today knows Dijkstra’s name (though few will remember the algorithm itself).
That would be me and you are correct on all counts. We used the book Structured Programming in some class or another; he was one of the co-authors.
Hello! It looks like you're interested in this conversation, but you don't have an account yet.
Getting fed up of having to scroll through the same posts each visit? When you register for an account, you'll always come back to exactly where you were before, and choose to be notified of new replies (either via email, or push notification). You'll also be able to save bookmarks and upvote posts to show your appreciation to other community members.
With your input, this post could be even better 💗
Register Login