The unpaired many-to-many k-disjoint paths in bipartite hypercube-like networks
Author:
Funder
National Natural Science Foundation of China
Publisher
Elsevier BV
Subject
General Computer Science,Theoretical Computer Science
Reference20 articles.
1. The 1-fixed-endpoint path cover problem is polynomial on interval graphs;Asdre;Algorithmica,2010
2. Generalized hypercube and hyperbus structures for a computer network;Bhuyan;IEEE Trans. Comput.,1984
3. Many-to-many disjoint paths in faulty hypercubes;Chen;Inf. Sci.,2009
4. Two node-disjoint paths in balanced hypercubes;Cheng;Appl. Math. Comput.,2014
5. The Möbius cubes;Cull;IEEE Trans. Comput.,1995
Cited by 6 articles. 订阅此论文施引文献 订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Concentration behavior: 50 percent of h-extra edge connectivity of pentanary n-cube with exponential faulty edges;Journal of Combinatorial Optimization;2024-01-24
2. The disjoint path cover in the data center network HSDC with prescribed vertices in each path;Applied Mathematics and Computation;2023-12
3. Paired 3-Disjoint Path Covers in Bipartite Torus-Like Graphs with Edge Faults;International Journal of Foundations of Computer Science;2022-11-09
4. Characterization of interval graphs that are paired 2-disjoint path coverable;The Journal of Supercomputing;2022-08-22
5. Embedded connectivity of some BC networks;The Journal of Supercomputing;2022-05-09
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3