"Developing the Parallelization Methods for Finding the All-Pairs Shortest ..."

Mohammed Alghamdi et al. (2019)

> Home

Details and statistics

DOI: 10.1109/IPCCC47392.2019.8958713

access: closed

type: Conference or Workshop Paper

metadata version: 2022-06-23

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/ipccc/AlghamdiHZL19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ipccc/AlghamdiHZL19
Mohammed Alghamdi, Ligang He, Yujue Zhou, Junyu Li:
Developing the Parallelization Methods for Finding the All-Pairs Shortest Paths in Distributed Memory Architecture. IPCCC 2019: 1-8

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.