Near-Optimal Algorithms for Reachability, Strongly-Connected Components and Shortest Paths in Partially Dynamic Digraphs · HackerPapers discussionshttps://hackerpaper.kaipfister.de/p/2011.13702/Collected HN comments and submissions linking this paper.enMon, 02 Nov 2026 11:16:22 GMTNear-Optimal Algorithms for Reachability, Strongly-Connected Components and Shortest Paths in Partially Dynamic Digraphs — mentioned by teleforcehttps://news.ycombinator.com/item?id=26443830urn:hackerpapers:mention:2011.13702:26443830Sat, 13 Mar 2021 04:00:20 GMT<p>This is the link for the full PhD thesis: https://arxiv.org/abs/2011.13702</p><p><a href="https://hackerpaper.kaipfister.de/p/2011.13702/">Paper and discussion history</a>. A mention is not an endorsement.</p>cs.DS