Encyclopedia of Algorithms

Living Edition
| Editors: Ming-Yang Kao

All-Distances Sketches

  • Edith CohenEmail author
Living reference work entry
DOI: https://doi.org/10.1007/978-3-642-27848-8_574-1

Years and Authors of Summarized Original Work

1997, 2014 ; Cohen2002; Palmer, Gibbons, and Faloutsos2004, 2007; Cohen and Kaplan

Problem Definition

All-distances sketches (The term least element lists was used in [3]; the terms MV/D lists and Neighborhood summaries were used in [6].) are randomized summary structures of the distance relations of nodes in a graph. The graph can be directed or undirected, and edges can have uniform or general nonnegative weights.

Preprocessing cost: A set of sketches, \(\mathop{\mathrm{ADS}}(v)\)


Summary structures Graph analysis Distance distribution Nodes similarity Influence Distinct counting 
This is a preview of subscription content, log in to check access.

Recommended Reading

  1. 1.
    Boldi P, Vigna S (2014) Axioms for centrality. Internet Math 10:222–262CrossRefMathSciNetGoogle Scholar
  2. 2.
    Boldi P, Rosa M, Vigna S (2011) HyperANF: approximating the neighbourhood function of very large graphs on a budget. In: WWW, HyderabadGoogle Scholar
  3. 3.
    Cohen E (1997) Size-estimation framework with applications to transitive closure and reachability. J Comput Syst Sci 55:441–453CrossRefzbMATHGoogle Scholar
  4. 4.
    Cohen E (2014) All-distances sketches, revisited: HIP estimators for massive graphs analysis. In: PODS. ACM. http://arxiv.org/abs/1306.3284
  5. 5.
    Cohen E (2014) Estimation for monotone sampling: competitiveness and customization. In: PODC. ACM. http://arxiv.org/abs/1212.0243, full version http://arxiv.org/abs/1212.0243
  6. 6.
    Cohen E, Kaplan H (2007) Spatially-decaying aggregation over a network: model and algorithms. J Comput Syst Sci 73:265–288. Full version of a SIGMOD 2004 paperGoogle Scholar
  7. 7.
    Cohen E, Kaplan H (2007) Summarizing data using bottom-k sketches. In: PODC, Portland. ACMGoogle Scholar
  8. 8.
    Cohen E, Delling D, Fuchs F, Goldberg A, Goldszmidt M, Werneck R (2013) Scalable similarity estimation in social networks: closeness, node labels, and random edge lengths. In: COSN, Boston. ACMGoogle Scholar
  9. 9.
    Cohen E, Delling D, Pajor T, Werneck RF (2014) Timed influence: computation and maximization. ManuscriptGoogle Scholar
  10. 10.
    Dangalchev C (2006) Residual closeness in networks. Phisica A 365:556–564CrossRefGoogle Scholar
  11. 11.
    Flajolet P, Martin GN (1985) Probabilistic counting algorithms for data base applications. J Comput Syst Sci 31:182–209CrossRefzbMATHMathSciNetGoogle Scholar
  12. 12.
    Flajolet P, Fusy E, Gandouet O, Meunier F (2007) Hyperloglog: the analysis of a near-optimal cardinality estimation algorithm. In: Analysis of algorithms (AOFA), Juan des PinsGoogle Scholar
  13. 13.
    Guibas LJ, Knuth DE, Sharir M (1992) Randomized incremental construction of Delaunay and Voronoi diagrams. Algorithmica 7:381–413CrossRefzbMATHMathSciNetGoogle Scholar
  14. 14.
    Opsahl T, Agneessens F, Skvoretz J (2010) Node centrality in weighted networks: generalizing degree and shortest paths. Soc Netw 32. http://toreopsahl.com/2010/03/20/
  15. 15.
    Palmer CR, Gibbons PB, Faloutsos C (2002) ANF: a fast and scalable tool for data mining in massive graphs. In: KDD, EdmontonGoogle Scholar
  16. 16.
    Thorup M, Zwick U (2001) Approximate distance oracles. In: Proceedings of the 33th annual ACM symposium on theory of computing, Crete, pp 183–192Google Scholar

Copyright information

© Springer Science+Business Media New York 2014

Authors and Affiliations

  1. 1.Tel Aviv UniversityTel AvivIsrael