An Efficient BSP/CGM Algorithm for the Matrix Chain Ordering Problem

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.

@inproceedings{KechidM08:0,
  title = {An Efficient BSP/CGM Algorithm for the Matrix Chain Ordering Problem},
  author = {Mounir Kechid and Jean Frédéric Myoupo},
  year = {2008},
  researchr = {https://researchr.org/publication/KechidM08%3A0},
  cites = {0},
  citedby = {0},
  pages = {327-332},
  booktitle = {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},
  editor = {Hamid R. Arabnia and Youngsong Mun},
  publisher = {CSREA Press},
  isbn = {1-60132-084-1},
}