An Empirical Comparison of k-Shortest Simple Path Algorithms on Multicores-Reference-Cited by-同舟云学术

An Empirical Comparison of k-Shortest Simple Path Algorithms on Multicores

Published:2018-08-13 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 47th International Conference on Parallel Processing
language:
Short-container-title:

Author:

Ajwani Deepak¹,Duriakova Erika²,Hurley Neil²,Meyer Ulrich³,Schickedanz Alexander³

Affiliation:

1. Nokia Bell Laboratories, Dublin, Ireland

2. Insight Centre for Data Analytics, School of Computer Science, University College Dublin, Dublin, Ireland

3. Goethe University, Frankfurt, Germany

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3225058.3225075

Reference45 articles.

1. Udit Agarwal and Vijaya Ramachandran. 2015. Finding k Simple Shortest Paths and Cycles. CoRR abs/1512.02157 (2015). Udit Agarwal and Vijaya Ramachandran. 2015. Finding k Simple Shortest Paths and Cycles. CoRR abs/1512.02157 (2015).

2. Connecting the Dots: Explaining Relationships Between Unconnected Entities in a Knowledge Graph

3. GPU Multisplit

4. A nearly optimal oracle for avoiding failed vertices and edges

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A Distributed Solution for Efficient K Shortest Paths Computation Over Dynamic Road Networks;IEEE Transactions on Knowledge and Data Engineering;2024-07

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. Top-k Distance Queries on Large Time-Evolving Graphs;IEEE Access;2023

4. Comparison of different algorithms for time analysis for CPM schedule networks;Automation in Construction;2021-07

5. Average-Case Behavior of k-Shortest Path Algorithms;Studies in Computational Intelligence;2018-12-02