A synchronous algorithm for shortest paths on a tree machine

DOI10.1016/0167-8191(92)90115-NMaRDI QIDQ1185929zbMATH OpenFDO

Authors El-Sayed M. El-Horbaty, Alaa El-Din H. Mohamed

Publication date 28 June 1992

Published in Parallel Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-8191(92)90115-N

zbMATH Keywords

complexity timeparallel algorithmsshortest paths problemstree machines

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)

Recommendations

• scientific article; zbMATH DE number 1186513
• An O(nm)-time network simplex algorithm for the shortest path problem
• scientific article; zbMATH DE number 56471
• scientific article; zbMATH DE number 1093953

Cited in

(2)

• scientific article; zbMATH DE number 1186513 (Why is no real title available?)
• scientific article; zbMATH DE number 2016676 (Why is no real title available?)

This page was built for publication: A synchronous algorithm for shortest paths on a tree machine

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1185929)