Neighbourhood Broadcasting and Broadcasting on the (n, k)-Star Graph

Author:

He L.,Qiu K.,Shen Z. Z.

Publisher

Springer Berlin Heidelberg

Reference16 articles.

1. Akers, S.B., Krishnamurthy, B.: A Group Theoretic Model for Symmetric Interconnection Networks. IEEE Transactions on Computers c-38(4), 555–566 (1989)

2. Bermond, J.C., Ferreira, A., Pérennes, S., Peters, J.G.: Neighbourhood broadcasting in hypercubes, Technical Report, SFU-CMPT-TR 2004-12, School of Computing Science, Simon Fraser University, Canada

3. Chen, Y.S., Tai, K.S.: A Near-Optimal Broadcasting in (n, k)-Star Graphs. In: ACIS International Conference on Software Engineering Applied to Networking and Parallel/Distributed Computing (SNPD 2000), pp. 217–224 (2000)

4. Chiang, W.K., Chen, R.J.: The (n, k)-Star Graph: A Generalized Star Graph. Information Processing Letters 56, 259–264 (1995)

5. Chiang, W.K., Chen, R.J.: Topological Properties of (n, k)-Star Graph. International Journal of Foundations of Computer Science 9(2), 235–248 (1997)

Cited by 5 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. A recurrence for the surface area of the (n,k)$$ \left(n,k\right) $$‐star graph;Concurrency and Computation: Practice and Experience;2024-02-29

2. Performance Benchmark of Machine Learning-Based Methodology for Swahili News Article Categorization;2022 21st IEEE International Conference on Machine Learning and Applications (ICMLA);2022-12

3. A Recurrence for the Surface Area of the ($n, k$)-Star Graph;2022 Tenth International Symposium on Computing and Networking (CANDAR);2022-11

4. Routing and Broadcasting Algorithms for Generalized-Star Cube;International Journal of Networking and Computing;2016

5. Distance formula and shortest paths for the (n,k)-star graphs;Information Sciences;2010-05

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3