"All-Pairs Shortest Paths Computation in the BSP Model."

Alexandre Tiskin (2001)

> Home

Details and statistics

DOI: 10.1007/3-540-48224-5_15

access: closed

type: Conference or Workshop Paper

metadata version: 2021-07-25

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/icalp/Tiskin01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icalp/Tiskin01
Alexandre Tiskin:
All-Pairs Shortest Paths Computation in the BSP Model. ICALP 2001: 178-189

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.