"A Decomposition Algorithm for the All-Pairs Shortest Path Problem on ..."

Mayiz B. Habbal, Haris N. Koutsopoulos, Steven R. Lerman (1994)

> Home

Details and statistics

DOI: 10.1287/TRSC.28.4.292

access: closed

type: Journal Article

metadata version: 2020-09-08

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/transci/HabbalKL94
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/transci/HabbalKL94
Mayiz B. Habbal, Haris N. Koutsopoulos, Steven R. Lerman:
A Decomposition Algorithm for the All-Pairs Shortest Path Problem on Massively Parallel Computer Architectures. Transp. Sci. 28(4): 292-308 (1994)

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.