scientific article; zbMATH DE number 1057774

MaRDI QIDQ4352830zbMATH OpenFDO

Authors Marios C. Papaefthymiou, Joseph Rodrigue

Publication date 10 May 1998

zbMATH Keywords

Bellman-Ford-Moore algorithmparallel versionssingle-source shortest-paths problem

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Programming involving graphs or networks (90C35)

Recommendations

• scientific article; zbMATH DE number 56471
• Parallel Algorithms for Dynamic Shortest Path Problems
• scientific article; zbMATH DE number 278831
• Parallel asynchronous label-correcting methods for shortest paths

Cited in

(4)

• Automated verification of the parallel Bellman-Ford algorithm
• Single-source shortest paths with the parallel boost graph library
• scientific article; zbMATH DE number 56471 (Why is no real title available?)
• Computational Science – ICCS 2005

This page was built for publication:

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