Converting a network into a small-world network: Fast algorithms for minimizing average path length through link addition-Reference-Cited by-同舟云学术

Converting a network into a small-world network: Fast algorithms for minimizing average path length through link addition

Published:2018-01 Issue: Volume:422 Page:282-289
ISSN:0020-0255
Container-title:Information Sciences
language:en
Short-container-title:Information Sciences

Author:

Gozzard Andrew,Ward Max,Datta Amitava

Publisher

Elsevier BV

Subject

Artificial Intelligence,Information Systems and Management,Computer Science Applications,Theoretical Computer Science,Control and Systems Engineering,Software

Reference15 articles.

1. Deterministic small-world networks;Comellas;Phys. A Stat. Mech. Appl.,2002

2. Introduction to Algorithms;Cormen,2001

3. CMP network-on-chip overlaid with multi-band RF-interconnect;Chang,2008

4. RF interconnects for communications on-chip;Chang,2008

5. A delay-tolerant network architecture for challenged internets;Fall;Proc. ACM SIGCOMM,2003

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

1. Brief Announcement: Minimizing the Weighted Average Shortest Path Length in Demand-Aware Networks via Matching Augmentation;Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures;2024-06-17

2. Characterization and design of three-dimensional skeleton structure of asphalt mixture based on network science;Construction and Building Materials;2024-03

3. Optimizing Reconfigurable Optical Datacenters: The Power of Randomization;Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis;2023-11-11

4. Inhalt;Sozialtheorie;2023-07-05

5. Frontmatter;Sozialtheorie;2023-07-05