All-pairs shortest paths computation in the BSP model

DOI10.1007/3-540-48224-5_15MaRDI QIDQ4535018zbMATH OpenFDO

Authors Alexander Tiskin

Publication date 12 June 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2076/20760178

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Parallel algorithms in computer science (68W10)

Recommendations

• Efficient algorithms for the shortest paths and minimum spanning tree on the BSP model
• The bulk-synchronous parallel random access machine
• Direct bulk-synchronous parallel algorithms
• Memory-efficient matrix multiplication in the BSP model
• Communication efficient BSP algorithm for all nearest smaller values problem

Cited in

(5)

• Memory-efficient matrix multiplication in the BSP model
• Sparse matrix multiplication and triangle listing in the congested clique model
• Efficient algorithms for the shortest paths and minimum spanning tree on the BSP model
• Delta-stepping synchronous parallel model
• Communication efficient BSP algorithm for all nearest smaller values problem

This page was built for publication: All-pairs shortest paths computation in the BSP model

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