{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,30]],"date-time":"2025-05-30T15:06:27Z","timestamp":1748617587102,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642197536"},{"type":"electronic","value":"9783642197543"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-19754-3_11","type":"book-chapter","created":{"date-parts":[[2011,3,28]],"date-time":"2011-03-28T09:22:38Z","timestamp":1301304158000},"page":"92-103","source":"Crossref","is-referenced-by-count":11,"title":["A Comparison of Three Algorithms for Approximating the Distance Distribution in Real-World Graphs"],"prefix":"10.1007","author":[{"given":"Pierluigi","family":"Crescenzi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roberto","family":"Grossi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Leonardo","family":"Lanzi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrea","family":"Marino","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"Blondel, V., Guillaume, J.L., Hendrickx, J., Jungers, R.: Distance Distribution in Random Graphs and Applications to Network Exploration. Phys. Rev. E 76 (2007)","DOI":"10.1103\/PhysRevE.76.066101"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Boldi, P., Vigna, S.: The WebGraph framework I: Compression techniques. In: Proc. of the 13th International World Wide Web Conference, pp. 595\u2013601 (2004)","DOI":"10.1145\/988672.988752"},{"key":"11_CR3","unstructured":"Cohen, E.: Estimating the size of the transitive closure in linear time. In: Annual IEEE Symposium on Foundations of Computer Science, pp. 190\u2013200 (1994)"},{"issue":"3","key":"11_CR4","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1006\/jcss.1997.1534","volume":"55","author":"E. Cohen","year":"1997","unstructured":"Cohen, E.: Size-estimation framework with applications to transitive closure and reachability. J. Comput. Syst. Sci.\u00a055(3), 441\u2013453 (1997)","journal-title":"J. Comput. Syst. Sci."},{"key":"11_CR5","first-page":"353","volume-title":"ACM SIGMETRICS","author":"E. Cohen","year":"2007","unstructured":"Cohen, E., Kaplan, H.: Bottom-k sketches: better and more efficient estimation of aggregates. In: ACM SIGMETRICS, pp. 353\u2013354. ACM, New York (2007)"},{"issue":"3","key":"11_CR6","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/j.jcss.2006.10.016","volume":"73","author":"E. Cohen","year":"2007","unstructured":"Cohen, E., Kaplan, H.: Spatially-decaying aggregation over a network. J. Comput. Syst. Sci.\u00a073(3), 265\u2013288 (2007)","journal-title":"J. Comput. Syst. Sci."},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"Cohen, E., Kaplan, H.: Summarizing data using bottom-k sketches. In: ACM PODC, pp. 225\u2013234 (2007)","DOI":"10.1145\/1281100.1281133"},{"issue":"1","key":"11_CR8","first-page":"213","volume":"1","author":"E. Cohen","year":"2008","unstructured":"Cohen, E., Kaplan, H.: Tighter estimation using bottom k sketches. PVLDB\u00a01(1), 213\u2013224 (2008)","journal-title":"PVLDB"},{"key":"11_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1007\/978-3-642-15775-2_26","volume-title":"Algorithms \u2013 ESA 2010","author":"P. Crescenzi","year":"2010","unstructured":"Crescenzi, P., Grossi, R., Imbrenda, C., Lanzi, L., Marino, A.: Finding the Diameter in Real-World Graphs: Experimentally Turning a Lower Bound into an Upper Bound. In: de Berg, M., Meyer, U. (eds.) ESA 2010. LNCS, vol.\u00a06346, pp. 302\u2013313. Springer, Heidelberg (2010)"},{"key":"11_CR10","unstructured":"Eppstein, D., Wang, J.: Fast approximation of centrality. In: ACM\/SIAM SODA, pp. 228\u2013229 (2001)"},{"issue":"2","key":"11_CR11","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1016\/0022-0000(85)90041-8","volume":"31","author":"P. Flajolet","year":"1985","unstructured":"Flajolet, P., Martin, G.N.: Probabilistic Counting Algorithms for Data Base Applications. Journal of Computer Systems Science\u00a031(2), 182\u2013209 (1985)","journal-title":"Journal of Computer Systems Science"},{"key":"11_CR12","unstructured":"Latapy, M., Magnien, C.: Measuring Fundamental Properties of Real-World Complex Networks. CoRR abs\/cs\/0609115 (2006)"},{"key":"11_CR13","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Kleinberg, J., Faloutsos, C.: Graph Evolution: Densification and Shrinking Diameters. ACM Trans. Knowl. Discov. Data\u00a01(1) (2007)","DOI":"10.1145\/1217299.1217301"},{"issue":"1","key":"11_CR14","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1006\/jcss.1995.1050","volume":"51","author":"R.J. Lipton","year":"1995","unstructured":"Lipton, R.J., Naughton, J.F.: Query size estimation by adaptive sampling. J. Comput. Syst. Sci.\u00a051(1), 18\u201325 (1995)","journal-title":"J. Comput. Syst. Sci."},{"key":"11_CR15","volume-title":"Distributed Algorithms","author":"N. Lynch","year":"1996","unstructured":"Lynch, N.: Distributed Algorithms. Morgan Kaufmann, San Francisco (1996)"},{"key":"11_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"723","DOI":"10.1007\/3-540-45749-6_63","volume-title":"Algorithms - ESA 2002","author":"K. Mehlhorn","year":"2002","unstructured":"Mehlhorn, K., Meyer, U.: External-memory breadth-first search with sublinear I\/O. In: M\u00f6hring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol.\u00a02461, pp. 723\u2013735. Springer, Heidelberg (2002)"},{"key":"11_CR17","doi-asserted-by":"crossref","unstructured":"Palmer, C.R., Gibbons, P.B., Faloutsos, C.: ANF: a Fast and Scalable Tool for Data Mining in Massive Graphs. In: ACM SIGKDD, pp. 81\u201390 (2002)","DOI":"10.1145\/775047.775059"},{"issue":"8","key":"11_CR18","doi-asserted-by":"publisher","first-page":"780","DOI":"10.1016\/j.aml.2005.09.004","volume":"19","author":"L. Wang","year":"2006","unstructured":"Wang, L., Subramanian, S., Latifi, S., Srimani, P.: Distance Distribution of Nodes in Star Graphs. Applied Mathematics Letters\u00a019(8), 780\u2013784 (2006)","journal-title":"Applied Mathematics Letters"}],"container-title":["Lecture Notes in Computer Science","Theory and Practice of Algorithms in (Computer) Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-19754-3_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,4]],"date-time":"2025-03-04T18:25:23Z","timestamp":1741112723000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-19754-3_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642197536","9783642197543"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-19754-3_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}