Determining the diameter of small world networks

46Citations
Citations of this article
45Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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 that uses various lower and upper bounds as well as effective node selection and pruning strategies in order to evaluate only the critical nodes which ultimately determine the diameter. We will show that our algorithm is able to quickly determine the exact diameter of various large datasets of small world networks with millions of nodes and hundreds of millions of links, whereas before only approximations could be given. © 2011 ACM.

Cite

CITATION STYLE

APA

Takes, F. W., & Kosters, W. A. (2011). Determining the diameter of small world networks. In International Conference on Information and Knowledge Management, Proceedings (pp. 1191–1196). https://doi.org/10.1145/2063576.2063748

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free