Subject
Computational Theory and Mathematics,Computational Mathematics,Control and Optimization
Reference93 articles.
1. Greedy partitioned algorithms for the shortest path problem;Adamson;Internat. J. Parallel Program.,1991
2. Network flows: Theory, Algorithms, and Applications;Ahuja,1993
3. Faster algorithms for the shortest path problem;Ahuja;J. ACM,1990
4. Parallel integer optimization for crew scheduling;Alefragis;Ann. Oper. Res.,2000
5. The Probabilistic Method;Alon,1992
Cited by
192 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A Parallel Algorithm for Updating a Multi-objective Shortest Path in Large Dynamic Networks;Proceedings of the SC '23 Workshops of The International Conference on High Performance Computing, Network, Storage, and Analysis;2023-11-12
2. PeeK: A Prune-Centric Approach for K Shortest Path Computation;Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis;2023-11-11
3. Finding Bottlenecks in Message Passing Interface Programs by Scalable Critical Path Analysis;Algorithms;2023-10-31
4. A Case Study of an Adaptive Delta-Stepping Algorithm in OpenMP;2023 Research, Invention, and Innovation Congress: Innovative Electricals and Electronics (RI2C);2023-08-24
5. Efficient Construction of Directed Hopsets and Parallel Single-source Shortest Paths (Abstract);Proceedings of the 2023 ACM Workshop on Highlights of Parallel Computing;2023-07-18