A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Determining the diameter of small world networks
2011
Proceedings of the 20th ACM international conference on Information and knowledge management - CIKM '11
In this paper we present a novel approach to determine the exact diameter (longest shortest path length) of large graphs, in particular of the nowadays frequently studied small world networks. Typical examples include social networks, gene networks, web graphs and internet topology networks. Due to complexity issues, the diameter is often calculated based on a sample of only a fraction of the nodes in the graph, or some approximation algorithm is applied. We instead propose an exact algorithm
doi:10.1145/2063576.2063748
dblp:conf/cikm/TakesK11
fatcat:desrvsasp5az7okivkalr3lgoq