Determining the diameter of small world networks
Authors:
Open Access
- 24 October 2011
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 1191-1196
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- DBpedia - A crystallization point for the Web of DataJournal of Web Semantics, 2009
- Fast computation of empirically tight bounds for the diameter of massive graphsACM Journal of Experimental Algorithmics, 2009
- Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined ClustersInternet Mathematics, 2009
- Measurement and analysis of online social networks2007
- Graph evolutionACM Transactions on Knowledge Discovery From Data, 2007
- Small-world characteristics of Internet topologies and implications on multicast scalingComputer Networks, 2006
- Scale-free networks in cell biologyJournal of Cell Science, 2005
- The Enron Corpus: A New Dataset for Email Classification Research2004
- Evolution of the social network of scientific collaborationsPhysica A: Statistical Mechanics and its Applications, 2002
- All-Pairs Almost Shortest PathsSIAM Journal on Computing, 2000