谷歌浏览器插件
订阅小程序
在清言上使用

PeeK: A Prune-Centric Approach for K Shortest Path Computation

Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis(2023)

引用 0|浏览12
关键词
Shortest Path,Upper Bound,Parallelization,Key Observation,Parallel Method,Original Graph,Time Complexity,Shortest Distance,Upper Value,Multiple Paths,Adaptive Selection,Sequential Algorithm,Parallel Data,Vertex Degree,Node Classification,Dynamic Graph,Upper Bound Value,Dynamic Update,Reverse Path,Source Vertex,Control Flow Graph,Compact Method,Tight Upper Bound,Target Path,Candidate Paths,Low Earth Orbit,Sorting Algorithm
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要