"An Efficient CGM-Based Parallel Algorithm for Solving the Optimal Binary ..."

Vianney Kengne Tchendji, Jerry Lacmou Zeutouo (2019)

> Home

Details and statistics

DOI: 10.1007/S41019-019-0093-9

access: open

type: Journal Article

metadata version: 2025-01-19

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/dase/TchendjiZ19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dase/TchendjiZ19
Vianney Kengne Tchendji, Jerry Lacmou Zeutouo:
An Efficient CGM-Based Parallel Algorithm for Solving the Optimal Binary Search Tree Problem Through One-to-All Shortest Paths in a Dynamic Graph. Data Sci. Eng. 4(2): 141-156 (2019)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.