Graph algorithms with small communication costs

DOI10.1023/A:1009859026994zbMATH Open0969.90076OpenAlexW2108310473MaRDI QIDQ1587586FDOQ1587586

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

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

zbMATH Keywords

shortest pathlist rankingpermutation graphcommutation phasecourse-grained parallel algorithms

Mathematics Subject Classification ID

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

Cited In (3)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Efficient parallel graph algorithms for coarse grained multicomputers and BSP

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)