An Efficient CGM-Based Parallel Algorithm for Solving the Optimal Binary Search Tree Problem Through One-to-All Shortest Paths in a Dynamic Graph
Author:
Publisher
Springer Science and Business Media LLC
Subject
Computer Science Applications,Computational Mechanics
Link
http://link.springer.com/content/pdf/10.1007/s41019-019-0093-9.pdf
Reference34 articles.
1. Alves CER, Cáceres EN, Dehne F (2002) Parallel dynamic programming for solving the string editing problem on a CGM/BSP. In: Proceedings of the fourteenth annual ACM symposium on parallel algorithms and architectures, ACM, New York, NY, USA, SPAA’02, pp 275–281
2. Alves CER, Cáceres EN, Dehne F, Song SW (2003) A parallel wavefront algorithm for efficient biological sequence comparison. In: Proceedings of the 2003 international conference on Computational science and its applications: PartII, ICCSA’03, pp 249–258
3. Alves CER, Caceres EN, Song SW (2006) A coarse-grained parallel algorithm for the all-substrings longest common subsequence problem. Algorithmica 45:301–335
4. Bradford PG (1994) Parallel dynamic programming. Ph.D. thesis, Indiana University
5. Caceres E, Dehne F, Ferreira A, Flocchini P, Rieping I, Roncato A, Santoro N, Song S (1997) Efficient parallel graph algorithms for coarse grained multicomputers and BSP. In: Algorithmica. Springer, pp 390–400
Cited by 10 articles. 订阅此论文施引文献 订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Dynamic scheduling method for data relay satellite networks considering hybrid system disturbances;Complex & Intelligent Systems;2023-09-14
2. High-Speed Retrieval Method for Unstructured Big Data Platform Based on K-Ary Search Tree Algorithm;2022 IEEE Conference on Telecommunications, Optics and Computer Science (TOCS);2022-12-11
3. Four-splitting based coarse-grained multicomputer parallel algorithm for the optimal binary search tree problem;International Journal of Parallel, Emergent and Distributed Systems;2022-07-28
4. A coarse-grained multicomputer parallel algorithm for the sequential substring constrained longest common subsequence problem;Parallel Computing;2022-07
5. PARP: A Parallel Traffic Condition Driven Route Planning Model on Dynamic Road Networks;ACM Transactions on Intelligent Systems and Technology;2021-12-31
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3