The Design of the Routing Algorithm for the Degree-Constrained Recovery Tree with the Maximum Probability-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

The Design of the Routing Algorithm for the Degree-Constrained Recovery Tree with the Maximum Probability

Published:2023 Issue:02 Volume:12 Page:718-727
ISSN:2324-7991
Container-title:Advances in Applied Mathematics
language:
Short-container-title:AAM

Author:

刘银惠

Publisher

Hans Publishers

Subject

General Medicine

Reference24 articles.

1. Shortest path problem considering on-time arrival probability

2. 周光发, 陈亮. 随机网络最大概率路径问题的模型与算法[J]. 解放军理工大学学报(自然科学版), 2016, 17(4): 391-395.

3. Variable neighborhood search for the degree-constrained minimum spanning tree problem

4. Euclidean bounded-degree spanning tree ratios

5. Clegg, B. (2006) The God Effect: Quantum Entanglement, Science’s Strangest Phenomenon. Macmillan Publishers, New York.

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP