%0 Journal Article %1 journals/dase/TchendjiZ19 %A Tchendji, Vianney Kengne %A Zeutouo, Jerry Lacmou %D 2019 %J Data Sci. Eng. %K dblp %N 2 %P 141-156 %T An Efficient CGM-Based Parallel Algorithm for Solving the Optimal Binary Search Tree Problem Through One-to-All Shortest Paths in a Dynamic Graph. %U http://dblp.uni-trier.de/db/journals/dase/dase4.html#TchendjiZ19 %V 4

@article{journals/dase/TchendjiZ19, added-at = {2020-09-01T00:00:00.000+0200}, author = {Tchendji, Vianney Kengne and Zeutouo, Jerry Lacmou}, biburl = {https://www.bibsonomy.org/bibtex/2b2935b5b6fa047dbdc45fcfa009f6047/dblp}, ee = {https://doi.org/10.1007/s41019-019-0093-9}, interhash = {3f8f6fb1a4f13a406ea94ac1d829a2ed}, intrahash = {b2935b5b6fa047dbdc45fcfa009f6047}, journal = {Data Sci. Eng.}, keywords = {dblp}, number = 2, pages = {141-156}, timestamp = {2020-09-09T12:11:10.000+0200}, title = {An Efficient CGM-Based Parallel Algorithm for Solving the Optimal Binary Search Tree Problem Through One-to-All Shortest Paths in a Dynamic Graph.}, url = {http://dblp.uni-trier.de/db/journals/dase/dase4.html#TchendjiZ19}, volume = 4, year = 2019 }