Abstract
In this paper, we will propose a new algorithm that computes the radius and the diameter of a graph G = (V,E), by finding bounds through heuristics and improving them until exact values can be guaranteed. Although the worst-case running time is \(\mathcal{O}(|V|\cdot |E|)\), we will experimentally show that, in the case of real-world networks, it performs much better, finding the correct radius and diameter value after 10–100 BFSes instead of |V| BFSes (independent of the value of |V|), and thus having running time \(\mathcal{O}(|E|)\). Apart from efficiency, compared to other similar methods, the one proposed in this paper has three other advantages. It is more robust (even in the worst cases, the number of BFSes performed is not very high), it is able to simultaneously compute radius and diameter (halving the total running time whenever both values are needed), and it works both on directed and undirected graphs with very few modifications. As an application example, we use our new algorithm in order to determine the solvability over time of the “six degrees of Kevin Bacon” game.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bavelas, A.: Communication Patterns in Task-Oriented Groups. The Journal of the Acoustical Society of America 22(6), 725–730 (1950)
Broder, A.Z., Kumar, R., Maghoul, F., Raghavan, P., Rajagopalan, S., Stata, R., Tomkins, A., Wiener, J.L.: Graph Structure in the Web. Computer Networks 33(1-6), 309–320 (2000)
Chechik, S., Larkin, D., Roditty, L., Schoenebeck, G., Tarjan, R.E., Williams, V.V.: Better approximation algorithms for the graph diameter. In: SODA, pp. 1041–1052 (2014)
Clemesha, A.: The Wiki Game (2013), http://thewikigame.com
Crescenzi, P., Grossi, R., Lanzi, L., Marino, A.: On computing the diameter of real-world directed (Weighted) graphs. In: Klasing, R. (ed.) SEA 2012. LNCS, vol. 7276, pp. 99–110. Springer, Heidelberg (2012)
Crescenzi, P., Grossi, R., Habib, M., Lanzi, L., Marino, A.: On Computing the Diameter of Real-World Undirected Graphs. Theor. Comput. Sci. 514, 84–95 (2013)
Gurevich, M.: The Social Structure of Acquaintanceship Networks, PhD Thesis (1961)
Leskovec, J., Kleinberg, J.M., Faloutsos, C.: Graph Evolution: Densification and Shrinking Diameters. TKDD 1(1) (2007)
Magnien, C., Latapy, M., Habib, M.: Fast Computation of Empirically Tight Bounds for the Diameter of Massive Graphs. Journal of Experimental Algorithmics 13 (2009)
Marino, A.: Algorithms for Biological Graphs: Analysis and Enumeration, PhD Thesis, Dipartimento di Sistemi e Informatica, University of Florence (2013)
Milgram, S.: The Small World Problem. Psychology Today 2, 60–67 (1967)
Reynolds, P.: The Oracle of Kevin Bacon (2013), http://oracleofbacon.org
Roditty, L., Williams, V.V.: Fast Approximation Algorithms for the Diameter and Radius of Sparse Graphs. In: STOC, pp. 515–524 (2013)
SNAP: Stanford Network Analysis Package (SNAP) Website (2009), http://snap.stanford.edu
Takes, F.W., Kosters, W.A.: Determining the Diameter of Small World Networks. In: CIKM, pp. 1191–1196 (2011)
Takes, F.W., Kosters, W.A.: Computing the Eccentricity Distribution of Large Graphs. Algorithms 6(1), 100–118 (2013)
Thompson, K., Bordwell, D.: Film History: an Introduction. McGraw-Hill Higher Education (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Borassi, M., Crescenzi, P., Habib, M., Kosters, W., Marino, A., Takes, F. (2014). On the Solvability of the Six Degrees of Kevin Bacon Game. In: Ferro, A., Luccio, F., Widmayer, P. (eds) Fun with Algorithms. FUN 2014. Lecture Notes in Computer Science, vol 8496. Springer, Cham. https://doi.org/10.1007/978-3-319-07890-8_5
Download citation
DOI: https://doi.org/10.1007/978-3-319-07890-8_5
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-07889-2
Online ISBN: 978-3-319-07890-8
eBook Packages: Computer ScienceComputer Science (R0)