Graph algorithms with small communication costs

DOI10.1023/A:1009859026994MaRDI QIDQ1587586zbMATHOpenAlexFDO

Authors J. Zhou, Xiaotie Deng, P. Dymond

Publication date 3 December 2000

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1009859026994

zbMATH Keywords

shortest pathlist rankingpermutation graphcommutation phasecourse-grained parallel algorithms

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Recommendations

• Efficient parallel graph algorithms for coarse-grained multicomputers and BSP
• scientific article; zbMATH DE number 934538
• Efficient parallel graph algorithms for coarse grained multicomputers and BSP
• scientific article; zbMATH DE number 1444289
• scientific article; zbMATH DE number 4033068

Cited in

(3)

• Efficient parallel graph algorithms for coarse grained multicomputers and BSP
• scientific article; zbMATH DE number 4033068 (Why is no real title available?)
• scientific article; zbMATH DE number 2102734 (Why is no real title available?)

This page was built for publication: Graph algorithms with small communication costs

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