The small-world phenomenon: an algorithmic perspective
暂无分享,去创建一个
[1] Sharon L. Milgram,et al. The Small World Problem , 1967 .
[2] S. Milgram,et al. Acquaintance Networks Between Racial Groups: Application of the Small World Method. , 1970 .
[3] H. White. Search Parameters for the Small World Problem , 1970 .
[4] J. Hunter,et al. Treating Data Collected by the “Small World” Method as a Markov Process , 1974 .
[5] M. Kochen,et al. Contacts and influence , 1978 .
[6] P. Killworth,et al. The reversal small-world experiment , 1978 .
[7] Fan Chung Graham,et al. Diameter bounds for altered graphs , 1984, J. Graph Theory.
[8] Béla Bollobás,et al. Random Graphs , 1985 .
[9] Béla Bollobás,et al. The Diameter of a Cycle Plus a Random Matching , 1988, SIAM J. Discret. Math..
[10] Eli Upfal,et al. A trade-off between space and efficiency for routing tables , 1989, JACM.
[11] John Guare,et al. Six Degrees of Separation: A Play , 1990 .
[12] Piotr Berman,et al. On-line Searching and Navigation , 1996, Online Algorithms.
[13] Bart Selman,et al. Referral Web: combining social networks and collaborative filtering , 1997, CACM.
[14] Duncan J. Watts,et al. Collective dynamics of ‘small-world’ networks , 1998, Nature.
[15] Lada A. Adamic. The Small World Web , 1999, ECDL.
[16] NET NEWS: It's a Small Web After All , 1999, Science.
[17] Xerox,et al. The Small World , 1999 .
[18] Russ Bubley,et al. Randomized algorithms , 1995, CSUR.
[19] Jon M. Kleinberg,et al. Navigation in a small world , 2000, Nature.
[20] Lali Barrière,et al. Efficient Routing in Networks with Long Range Contacts , 2001, DISC.
[21] M E J Newman,et al. Identity and Search in Social Networks , 2002, Science.
[22] Srdjan Capkun,et al. Small worlds in security systems: an analysis of the PGP certificate graph , 2002, NSPW '02.
[23] David K. Y. Yau,et al. Small-World Overlay P 2 P Networks : Construction and Handling Dynamic Flash Crowd , 2022 .