{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,26]],"date-time":"2025-10-26T14:22:15Z","timestamp":1761488535135},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642157745"},{"type":"electronic","value":"9783642157752"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15775-2_26","type":"book-chapter","created":{"date-parts":[[2010,9,1]],"date-time":"2010-09-01T14:47:32Z","timestamp":1283352452000},"page":"302-313","source":"Crossref","is-referenced-by-count":13,"title":["Finding the Diameter in Real-World Graphs"],"prefix":"10.1007","author":[{"given":"Pierluigi","family":"Crescenzi","sequence":"first","affiliation":[]},{"given":"Roberto","family":"Grossi","sequence":"additional","affiliation":[]},{"given":"Claudio","family":"Imbrenda","sequence":"additional","affiliation":[]},{"given":"Leonardo","family":"Lanzi","sequence":"additional","affiliation":[]},{"given":"Andrea","family":"Marino","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"26_CR1","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1002\/jgt.3190100211","volume":"10","author":"I. Alegre","year":"1986","unstructured":"Alegre, I., Fiol, M., Yebra, J.: Some large graphs with given degree and diameter. J. Graph Theory\u00a010, 219\u2013224 (1986)","journal-title":"J. Graph Theory"},{"key":"26_CR2","unstructured":"Boldi, P., Vigna, S.: Webgraph (2001), http:\/\/webgraph.dsi.unimi.it\/"},{"key":"26_CR3","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":"26_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/b106453","volume-title":"Network Analysis: Methodological Foundations","author":"U. Brandes","year":"2005","unstructured":"Brandes, U., Erlebach, T.: Network Analysis: Methodological Foundations. Springer, Heidelberg (2005)"},{"key":"26_CR5","unstructured":"Complexnetworks Team: Complex networks and real-world graphs (2008), http:\/\/complexnetworks.fr\/"},{"issue":"2-3","key":"26_CR6","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/S0166-218X(00)00281-X","volume":"113","author":"D.G. Corneil","year":"2001","unstructured":"Corneil, D.G., Dragan, F.E., Habib, M., Paul, C.: Diameter determination on restricted graph families. Discrete Appl. Math.\u00a0113(2-3), 143\u2013166 (2001)","journal-title":"Discrete Appl. Math."},{"key":"26_CR7","doi-asserted-by":"crossref","unstructured":"Faloutsos, C.: Graph mining: Patterns, generators and tools. In: Combinatorial Pattern Matching, p. 274 (2009)","DOI":"10.1007\/978-3-642-02441-2_24"},{"key":"26_CR8","doi-asserted-by":"crossref","unstructured":"Handler, G.: Minimax location of a facility in an undirected tree graph. Transportation Science\u00a07(287\u2013293) (1973)","DOI":"10.1287\/trsc.7.3.287"},{"key":"26_CR9","unstructured":"IMDB: The internet movie database (1990), http:\/\/www.imdb.com\/"},{"key":"26_CR10","unstructured":"Leskovec, J.: Stanford Network Analysis Package (SNAP) Website (2009), http:\/\/snap.stanford.edu"},{"key":"26_CR11","unstructured":"Library, S.L.D.: Citeseer Website (1997), http:\/\/citeseer.ist.psu.edu\/citeseer.html"},{"key":"26_CR12","doi-asserted-by":"crossref","unstructured":"Magnien, C., Latapy, M., Habib, M.: Fast computation of empirically tight bounds for the diameter of massive graphs. J. Exp. Algorithmics\u00a013 (2009)","DOI":"10.1145\/1412228.1455266"},{"key":"26_CR13","unstructured":"Massa, P., Souren, K.: Trustlet Website (2007), http:\/\/www.trustlet.org"},{"key":"26_CR14","doi-asserted-by":"crossref","unstructured":"Mehlhorn, K., Meyer, U.: External-memory breadth-first search with sublinear i\/o. In: Proceedings of the 10th Annual European Symposium on Algorithms, pp. 723\u2013735 (2002)","DOI":"10.1007\/3-540-45749-6_63"},{"key":"26_CR15","unstructured":"Sommer, C.: Christian sommer\u2019s homepage (2009), http:\/\/www.sommer.jp\/graphs\/"},{"key":"26_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/3-540-44676-1_3","volume-title":"Algorithms - ESA 2001","author":"U. Zwick","year":"2001","unstructured":"Zwick, U.: Exact and approximate distances in graphs - a survey. In: Meyer auf der Heide, F. (ed.) ESA 2001. LNCS, vol.\u00a02161, pp. 33\u201348. Springer, Heidelberg (2001)"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15775-2_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,3]],"date-time":"2019-06-03T00:18:21Z","timestamp":1559521101000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15775-2_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642157745","9783642157752"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15775-2_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}