An Efficient BSP/CGM Algorithm for the Matrix Chain Ordering Problem - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Mounir Kechid, Jean Frédéric Myoupo. An Efficient BSP/CGM Algorithm for the Matrix Chain Ordering Problem. In Hamid R. Arabnia, Youngsong Mun, editors, Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, PDPTA 2008, Las Vegas, Nevada, USA, July 14-17, 2008, 2 Volumes. pages 327-332, CSREA Press, 2008.

The following publications are possibly variants of this publication:

An Efficient CGM-Based Parallel Algorithm Solving the Matrix Chain Ordering ProblemJean Frédéric Myoupo, Vianney Kengne Tchendji. ijghpc, 6(2):74-100, 2014. [doi]

A fast sequential algorithm for the matrix chain ordering problemJerry Lacmou Zeutouo, Vianney Kengne Tchendji, Jean Frédéric Myoupo. concurrency, 33(24), 2021. [doi]

runs on WebDSL