Composition of Efficient Nested BSP Algorithms: Minimum Spanning Tree Computation as an Instructive Example
O. Bonorden, F. Meyer auf der Heide, R. Wanka, in: Int. Conf. on Parallel and Distributed Processing Techniques and Applications (PDPTA), 2002, pp. 2202–2208.
Download
No fulltext has been uploaded.
Conference Paper
| English
Author
Bonorden, Olaf;
Meyer auf der Heide, FriedhelmLibreCat;
Wanka, Rolf
Publishing Year
Proceedings Title
Int. Conf. on Parallel and Distributed Processing Techniques and Applications (PDPTA)
Page
2202-2208
LibreCat-ID
Cite this
Bonorden O, Meyer auf der Heide F, Wanka R. Composition of Efficient Nested BSP Algorithms: Minimum Spanning Tree Computation as an Instructive Example. In: Int. Conf. on Parallel and Distributed Processing Techniques and Applications (PDPTA). ; 2002:2202-2208.
Bonorden, O., Meyer auf der Heide, F., & Wanka, R. (2002). Composition of Efficient Nested BSP Algorithms: Minimum Spanning Tree Computation as an Instructive Example. In Int. Conf. on Parallel and Distributed Processing Techniques and Applications (PDPTA) (pp. 2202–2208).
@inproceedings{Bonorden_Meyer auf der Heide_Wanka_2002, title={Composition of Efficient Nested BSP Algorithms: Minimum Spanning Tree Computation as an Instructive Example}, booktitle={Int. Conf. on Parallel and Distributed Processing Techniques and Applications (PDPTA)}, author={Bonorden, Olaf and Meyer auf der Heide, Friedhelm and Wanka, Rolf}, year={2002}, pages={2202–2208} }
Bonorden, Olaf, Friedhelm Meyer auf der Heide, and Rolf Wanka. “Composition of Efficient Nested BSP Algorithms: Minimum Spanning Tree Computation as an Instructive Example.” In Int. Conf. on Parallel and Distributed Processing Techniques and Applications (PDPTA), 2202–8, 2002.
O. Bonorden, F. Meyer auf der Heide, and R. Wanka, “Composition of Efficient Nested BSP Algorithms: Minimum Spanning Tree Computation as an Instructive Example,” in Int. Conf. on Parallel and Distributed Processing Techniques and Applications (PDPTA), 2002, pp. 2202–2208.
Bonorden, Olaf, et al. “Composition of Efficient Nested BSP Algorithms: Minimum Spanning Tree Computation as an Instructive Example.” Int. Conf. on Parallel and Distributed Processing Techniques and Applications (PDPTA), 2002, pp. 2202–08.
Google Scholar