The following publications are possibly variants of this publication:
- An Efficient CGM-Based Parallel Algorithm for Solving the Optimal Binary Search Tree Problem Through One-to-All Shortest Paths in a Dynamic GraphVianney Kengne Tchendji, Jerry Lacmou Zeutouo. dase, 4(2):141-156, 2019. [doi]
- A Coarse Grain Multicomputer Algorithm Solving the Optimal Binary Search Tree ProblemMounir Kechid, Jean Frédéric Myoupo. itng 2008: 1186-1189 [doi]
- Parallel dynamic programming for solving the optimal search binary tree problem on CGMJean Frédéric Myoupo, Vianney Kengne Tchendji. ijhpcn, 7(4):269-280, 2014. [doi]
- High-performance CGM-based parallel algorithms for minimum cost parenthesizing problemJerry Lacmou Zeutouo, Vianney Kengne Tchendji, Jean Frédéric Myoupo. tjs, 78(4):5306-5332, 2022. [doi]