Login / Signup
An Efficient CGM-Based Parallel Algorithm for Solving the Optimal Binary Search Tree Problem Through One-to-All Shortest Paths in a Dynamic Graph.
Vianney Kengne Tchendji
Jerry Lacmou Zeutouo
Published in:
Data Sci. Eng. (2019)
Keyphrases
</>
binary search trees
parallel algorithm
shortest path
shortest path algorithm
data structure
dynamic graph
finding the shortest path
search tree
optimal path
dynamic programming
multi dimensional
weighted graph
query processing
geodesic distance