A Decomposition Algorithm for the All-Pairs Shortest Path Problem on Massively Parallel Computer Architectures

DOI10.1287/trsc.28.4.292zbMath0826.90119OpenAlexW2032177924MaRDI QIDQ4834227

Steven R. Lerman, Mayiz B. Habbal, Haris N. Koutsopoulos

Publication date: 5 July 1995

Published in: Transportation Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/trsc.28.4.292

zbMATH Keywords

shortest pathparallel computer architectures

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Parallel numerical computation (65Y05)

Related Items (5)

Data parallel computing for network-structured optimization problems ⋮ A dynamic route assignment model for guided and unguided vehicles with a massively parallel computing architecture ⋮ Spectral clustering-based community detection using graph distance and node attributes ⋮ A novel approach for modeling order picking paths ⋮ An extension of labeling techniques for finding shortest path trees

This page was built for publication: A Decomposition Algorithm for the All-Pairs Shortest Path Problem on Massively Parallel Computer Architectures