Edge-connectivity augmentation problems
Journal of Computer and System Sciences
The small-world phenomenon: an algorithmic perspective
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Minimizing Average Shortest Path Distances via Shortcut Edge Addition
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Sampling biases in network path measurements and what to do about it
Proceedings of the 9th ACM SIGCOMM conference on Internet measurement conference
Boosting social network connectivity with link revival
CIKM '10 Proceedings of the 19th ACM international conference on Information and knowledge management
Minimizing the diameter of a network using shortcut edges
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
Gelling, and melting, large graphs by edge manipulation
Proceedings of the 21st ACM international conference on Information and knowledge management
| Hi-index | 0.00 |
Small changes in the network topology can have dramatic effects on its capacity to disseminate information. In this paper, we consider the problem of adding a small number of ghost edges in the network in order to minimize the average shortest-path distance between nodes, towards a smaller-world network. We formalize the problem of suggesting ghost edges and we propose a novel method for quickly evaluating the importance of ghost edges in sparse graphs. Through experiments on real and synthetic data sets, we demonstrate that our approach performs very well, for a varying range of conditions, and it outperforms sensible baselines.