"Scalable All-pairs Shortest Paths for Huge Graphs on Multi-GPU Clusters."

Piyush Sao et al. (2021)

> Home

Details and statistics

DOI: 10.1145/3431379.3460651

access: closed

type: Conference or Workshop Paper

metadata version: 2024-05-07

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/hpdc/SaoLKTVP21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/hpdc/SaoLKTVP21
Piyush Sao, Hao Lu, Ramakrishnan Kannan, Vijay Thakkar, Richard W. Vuduc, Thomas E. Potok:
Scalable All-pairs Shortest Paths for Huge Graphs on Multi-GPU Clusters. HPDC 2021: 121-131

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.