Single-source shortest paths with the parallel boost graph library

MaRDI QIDQ3574269zbMATH OpenFDO

Authors Nick Edmonds, Alex Breuer, Douglas Gregor, Andrew Lumsdaine

Publication date 9 July 2010

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85) Extremal problems in graph theory (05C35)

Recommendations

• scientific article; zbMATH DE number 1057774
• Parallel performance research of shortest path problem based on PC cluster
• Δ-stepping: a parallelizable shortest path algorithm
• scientific article; zbMATH DE number 1305103
• A simple parallel algorithm for the single-source shortest path problem on planar digraphs

Cited in

(3)

• A parallel bio-inspired shortest path algorithm
• A survey on the distributed computing stack
• Branch-and-price for staff rostering: an efficient implementation using generic programming and nested column generation

Describes a project that uses

Uses Software

• BGL
• OpenMPI
• Boost
• PBGL
• GraphBase
• STAPL

This page was built for publication: Single-source shortest paths with the parallel boost graph library

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