Parallelization of All-Pairs-Shortest-Path Algorithms in Unweighted Graph-Reference-Cited by-同舟云学术

Parallelization of All-Pairs-Shortest-Path Algorithms in Unweighted Graph

Published:2020-01-15 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the International Conference on High Performance Computing in Asia-Pacific Region
language:
Short-container-title:

Author:

Nakao Masahiro¹,Murai Hitoshi¹,Sato Mitsuhisa¹

Affiliation:

1. RIKEN Center for Computational Science, Hyogo, Japan

Publisher

ACM

Link

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

Reference24 articles.

1. [n.d.]. The Degree/Diameter Problem - Combinatorics Wiki. http://combinatoricswiki.org/wiki/The_Degree/Diameter_Problem. [n.d.]. The Degree/Diameter Problem - Combinatorics Wiki. http://combinatoricswiki.org/wiki/The_Degree/Diameter_Problem.

2. Accelerating BFS via Data Structure-Aware Prefetching on GPU

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

1. Efficient Parallel Processing of All-Pairs Shortest Paths on Multicore and GPU Systems;IEEE Transactions on Consumer Electronics;2023

2. The method which works in parallel and distributed into a large-scale graph in the regulation of vehicle movement;PROBLEMS IN THE TEXTILE AND LIGHT INDUSTRY IN THE CONTEXT OF INTEGRATION OF SCIENCE AND INDUSTRY AND WAYS TO SOLVE THEM: (PTLICISIWS-2022);2023

3. Graph optimization algorithm using symmetry and host bias for low-latency indirect network;Parallel Computing;2022-12

4. Graph Optimization Algorithm Using Symmetry and Host Bias for Low-Latency Indirect Network;SSRN Electronic Journal;2022

5. GPU Parallelization of All-Pairs-Shortest-Path Algorithm in Low-Degree Unweighted Regular Graph;Proceedings of the The 8th International Virtual Conference on Applied Computing & Information Technology;2021-06-20