Ideas & society2021 · shared on Hacker News
Near-Optimal Decremental SSSP in Dense Weighted Digraphs
Explore Near-Optimal Decremental SSSP in Dense Weighted Digraphs, its original source and Hacker News discussions. Discover community perspectives and save it to your reading list.
GO BEYOND THE ABSTRACT
The conversation around the idea.
Original Hacker News threads. Different perspectives, questions, and things worth thinking about.
Showing up to 100 related threads. A paper may appear in a comment rather than the original submission.
Links found in the discussion
Up to 50 recent source links, in HN item order.
Yasbjornmunk ·
Researchers find superb algorithm for finding the shortest route
5 points2 comments
Yjoseluisq ·
Danish computer scientist has developed a superb algorithm for finding
5 points2 comments
Yhelstegt ·
Near-Optimal Decremental SSSP in Dense Weighted Digraphs
1 points0 comments