Suggesting ghost edges for a smaller world

International Conference on Information and Knowledge Management, Proceedings

Volumn , Issue , 2011, Pages 2305-2308

  Papagelis, Manos ^a   Bonchi, Francesco ^b   Gionis, Aristides ^b  

^a UNIVERSITY OF TORONTO   (Canada)

^b YAHOO RESEARCH   (Spain)

Author keywords

graph augmentation; small world; social networks

Indexed keywords

GRAPH AUGMENTATION; NETWORK TOPOLOGY; SHORTEST-PATH; SMALL WORLDS; SOCIAL NETWORKS; SPARSE GRAPHS; SYNTHETIC DATASETS;

ELECTRIC NETWORK TOPOLOGY; INFORMATION DISSEMINATION;

KNOWLEDGE MANAGEMENT;

EID: 83055197132     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2063576.2063952     Document Type: Conference Paper

References (7)

1. E. D. Demaine and M. Zadimoghaddam. Minimizing the diameter of a network using shortcut edges. In SWAT, 2010.
2. K. P. Eswaran and R. E. Tarjan. Augmentation problems. SIAM J. Comput., 5(4), 1976.
3. S. Kandula and R. Mahajan. Sampling biases in network path measurements and what to do about it. In IMC, 2009.
4. J. Kleinberg. The small-world phenomenon: an algorithm perspective. In STOC, 2000.
5. A. Meyerson and B. Tagiku. Minimizing average shortest path distances via shortcut edge addition. In APPROX-RANDOM, 2009.
6. Y. Tian, Q. He, Q. Zhao, X. Liu, and W.-c. Lee. Boosting social network connectivity with link revival. In CIKM, 2010.
7. T. Watanabe and A. Nakamura. Edge-connectivity augmentation problems. J. Comput. Syst. Sci., 35, 1987.