Funder
Ministry of Education - Singapore
Nanyang Technological University
Reference49 articles.
1. Some shortest path algorithms with decentralized information and communication requirements. Automatic Control;Abram J.;IEEE Transactions on,1982
2. Sparser: A Paradigm for Running Distributed Algorithms
3. A fast distributed shortest path algorithm for a class of hierarchically clustered data networks
Cited by
105 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Fast Broadcast in Highly Connected Networks;Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures;2024-06-17
2. A Near-Optimal Low-Energy Deterministic Distributed SSSP with Ramifications on Congestion and APSP;Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing;2024-06-17
3. An O(1)-rounds Deterministic Distributed Approximation Algorithm for the Traveling Salesman Problem in Congested Clique;2024 20th International Conference on Distributed Computing in Smart Systems and the Internet of Things (DCOSS-IoT);2024-04-29
4. Computing Replacement Paths in the CONGEST Model;Lecture Notes in Computer Science;2024
5. Finding a Small Vertex Cut on Distributed Networks;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02