Encyclopedia of Big Data Technologies

2019 Edition
| Editors: Sherif Sakr, Albert Y. Zomaya

Degrees of Separation and Diameter in Large Graphs

  • Pierluigi CrescenziEmail author
  • Andrea MarinoEmail author
Reference work entry
DOI: https://doi.org/10.1007/978-3-319-77525-8_59



Given a (di)graph G = (V, E) (strongly) connected, where n = |V | and m = |E| (note that, since the graph is connected, we have mn − 1), the distance between two vertices u, vV is the number of edges along the shortest path from u to v and is denoted as d(u, v). The number of nodes separating u and v, i.e., d(u, v) − 1, is also called degree of separation.

The eccentricity of a node u is ecc(u) =maxvVd(u, v), which measures in how many hops u can reach any other node in the graph. Hence, the diameter D (resp. the radius R) of G is defined as the maximum (resp. minimum) eccentricity among all the nodes, i.e., D =maxuVecc(u) (resp. R =minuVecc(u)).

Given a node uV and an h ∈ [D] (where, for any positive integer x, [x] denotes the set {1, 2, …, x}), we call Bh(u) the set {v : vV, d(u, v) ≤ h} and, similarly, Nh(u)...

This is a preview of subscription content, log in to check access.


  1. Abboud A, Williams VV, Wang JR (2016) Approximation and fixed parameter subquadratic algorithms for radius and diameter in sparse graphs. In: Proceedings of the twenty-seventh annual ACM-SIAM symposium on discrete algorithms, SODA 2016, Arlington, 10–12 Jan, pp 377–391Google Scholar
  2. Akiba T, Iwata Y, Kawata Y (2015) An exact algorithm for diameters of large real directed graphs. In: Experimental algorithms – proceedings of 14th international symposium, SEA 2015, Paris, 29 June–1 July 2015, pp 56–67CrossRefGoogle Scholar
  3. Backstrom L, Boldi P, Rosa M, Ugander J, Vigna S (2012) Four degrees of separation. In: Web science 2012, WebSci’12, Evanston, 22–24 June 2012, pp 33–42Google Scholar
  4. Boldi P, Vigna S (2003) The webgraph framework I: compression techniques. In: Proceedings of the 13th international world wide web conference. ACM, Manhattan, pp 595–601Google Scholar
  5. Boldi P, Rosa M, Vigna S (2011) Hyperanf: approximating the neighbourhood function of very large graphs on a budget. In: Proceedings of the 20th international conference on world wide web, WWW 2011, Hyderabad, 28 Mar–1 Apr 2011, pp 625–634Google Scholar
  6. Borassi M, Crescenzi P, Habib M, Kosters WA, Marino A, Takes FW (2015) Fast diameter and radius BFS-based computation in (weakly connected) real-world graphs: with an application to the six degrees of separation games. Theor Comput Sci 586:59–80MathSciNetzbMATHCrossRefGoogle Scholar
  7. Borassi M, Crescenzi P, Trevisan L (2017) An axiomatic and an average-case analysis of algorithms and heuristics for metric properties of graphs. In: Proceedings of the twenty-eighth annual ACM-SIAM symposium on discrete algorithms, SODA 2017, Barcelona, Hotel Porta Fira, 16–19 Jan, pp 920–939Google Scholar
  8. Brandes U (2005) Network analysis: methodological foundations, vol 3418. Springer Science & Business Media, BerlinzbMATHGoogle Scholar
  9. Brandes U, Pich C (2007) Centrality estimation in large networks. Int J Bifurcation Chaos 17(7):2303–2318MathSciNetzbMATHCrossRefGoogle Scholar
  10. Broder AZ (1997) On the resemblance and containment of documents. In: In compression and complexity of sequences (SEQUENCES’97). IEEE Computer Society, pp 21–29Google Scholar
  11. Cairo M, Grossi R, Rizzi R (2016) New bounds for approximating extremal distances in undirected graphs. In: Proceedings of the twenty-seventh annual ACM-SIAM symposium on discrete algorithms, SODA 2016, Arlington, 10–12 Jan 2016, pp 363–376Google Scholar
  12. Cohen E (1994) Estimating the size of the transitive closure in linear time. Annu IEEE Symp Found Comput Sci 35:190–200Google Scholar
  13. Cohen E (1997) Size-estimation framework with applications to transitive closure and reachability. J Comput Syst Sci 55(3):441–453MathSciNetzbMATHCrossRefGoogle Scholar
  14. Cohen E (2015) All-distances sketches, revisited: HIP estimators for massive graphs analysis. IEEE Trans Knowl Data Eng 27(9):2320–2334CrossRefGoogle Scholar
  15. Cohen E, Kaplan H (2007a) Bottom-k sketches: better and more efficient estimation of aggregates. In: ACM SIGMETRICS performance evaluation review, vol 35. ACM, pp 353–354Google Scholar
  16. Cohen E, Kaplan H (2007b) Summarizing data using bottom-k sketches. In: PODC, pp 225–234zbMATHGoogle Scholar
  17. Cohen E, Kaplan H (2008) Tighter estimation using bottom k sketches. PVLDB 1(1):213–224Google Scholar
  18. Crescenzi P, Grossi R, Imbrenda C, Lanzi L, Marino A (2010) Finding the diameter in real-world graphs: experimentally turning a lower bound into an upper bound. In: Proceeding ESA. LNCS, vol 6346, pp 302–313Google Scholar
  19. Crescenzi P, Grossi R, Lanzi L, Marino A (2011) A comparison of three algorithms for approximating the distance distribution in real-world graphs. In: Theory and practice of algorithms in (computer) systems – proceedings of first international ICST conference, TAPAS 2011, Rome, 18–20 Apr 2011, pp 92–103Google Scholar
  20. Crescenzi P, Grossi R, Lanzi L, Marino A (2012) On computing the diameter of real-world directed (weighted) graphs. In: Experimental algorithms – proceedings of 11th international symposium, SEA 2012, Bordeaux, 7–9 June 2012, pp 99–110Google Scholar
  21. Crescenzi P, Grossi R, Habib M, Lanzi L, Marino A (2013) On computing the diameter of real-world undirected graphs. Theor Comput Sci 514: 84–95MathSciNetzbMATHCrossRefGoogle Scholar
  22. Eppstein D, Wang J (2001) Fast approximation of centrality. In: Proceedings of the twelfth annual ACM-SIAM symposium on discrete algorithms, SODA’01. Society for Industrial and Applied Mathematics, Philadelphia, pp 228–229Google Scholar
  23. Flajolet P, Martin G (1985) Probabilistic counting algorithms for data base applications. J Comput Syst Sci 31(2):182–209MathSciNetzbMATHCrossRefGoogle Scholar
  24. Flajolet P, Éric Fusy, Gandouet O et al (2007) Hyperloglog: the analysis of a near-optimal cardinality estimation algorithm. In: Proceedings of the 2007 international conference on analysis of algorithms, INAOFA’07Google Scholar
  25. Hoeffding W (1963) Probability inequalities for sums of bounded random variables. J Am Stat Assoc 58(301):13–30MathSciNetzbMATHCrossRefGoogle Scholar
  26. Impagliazzo R, Paturi R, Zane F (2001) Which problems have strongly exponential complexity? J Comput Syst Sci 63(4):512–530MathSciNetzbMATHCrossRefGoogle Scholar
  27. Magnien C, Latapy M, Habib M (2009) Fast computation of empirically tight bounds for the diameter of massive graphs. J Exp Algorithmics 13:1–10MathSciNetzbMATHCrossRefGoogle Scholar
  28. Palmer CR, Gibbons PB, Faloutsos C (2002) ANF: a fast and scalable tool for data mining in massive graphs. In: Proceedings of the 8th ACM SIGKDD international conference on knowledge discovery and data mining, pp 81–90Google Scholar
  29. Roditty L, Williams VV (2013) Fast approximation algorithms for the diameter and radius of sparse graphs. In: Symposium on theory of computing conference, STOC’13, Palo Alto, 1–4 June 2013, pp 515–524Google Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  1. 1.Dipartimento di Matematica e InformaticaUniversità di FirenzeFlorenceItaly
  2. 2.Dipartimento di InformaticaUniversità di PisaPisaItaly