Composition of Efficient Nested BSP Algorithms: Minimum Spanning Tree Computation as an Instructive Example

Bonorden O, Meyer auf der Heide F, Wanka R (2002)

Publication Type: Conference contribution

Publication year: 2002

Pages Range: 2202-2208; 2002

Conference Proceedings Title: Proceedings of the Int. Conf. on Parallel and Distributed Processing Techniques and Applications (PDPTA)

Authors with CRIS profile

Rolf Wanka Professur für Informatik (Effiziente Algorithmen und Kombinatorische Optimierung)

Involved external institutions

Universität Paderborn DE Germany (DE)

How to cite

APA:

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 Proceedings of the Int. Conf. on Parallel and Distributed Processing Techniques and Applications (PDPTA) (pp. 2202-2208; 2002).

MLA:

Bonorden, Olaf, Friedhelm Meyer auf der Heide, and Rolf Wanka. "Composition of Efficient Nested BSP Algorithms: Minimum Spanning Tree Computation as an Instructive Example." Proceedings of the Int. Conf. on Parallel and Distributed Processing Techniques and Applications (PDPTA) 2002. 2202-2208; 2002.

BibTeX: Download