{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T04:42:21Z","timestamp":1773895341599,"version":"3.50.1"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319200859","type":"print"},{"value":"9783319200866","type":"electronic"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-20086-6_5","type":"book-chapter","created":{"date-parts":[[2015,6,19]],"date-time":"2015-06-19T08:27:10Z","timestamp":1434702430000},"page":"56-67","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["An Exact Algorithm for Diameters of Large Real Directed Graphs"],"prefix":"10.1007","author":[{"given":"Takuya","family":"Akiba","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yoichi","family":"Iwata","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuki","family":"Kawata","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,6,20]]},"reference":[{"issue":"6749","key":"5_CR1","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1038\/43601","volume":"401","author":"R Albert","year":"1999","unstructured":"Albert, R., Jeong, H., Barab\u00e1si, A.-L.: Diameter of the World-Wide web. Nature 401(6749), 130\u2013131 (1999)","journal-title":"Nature"},{"key":"5_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/978-3-319-07890-8_5","volume-title":"Fun with Algorithms","author":"M Borassi","year":"2014","unstructured":"Borassi, M., Crescenzi, P., Habib, M., Kosters, W., Marino, A., Takes, F.: On the solvability of the six degrees of kevin bacon game. In: Ferro, A., Luccio, F., Widmayer, P. (eds.) FUN 2014. LNCS, vol. 8496, pp. 52\u201363. Springer, Heidelberg (2014)"},{"issue":"1\u20136","key":"5_CR3","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/S1389-1286(00)00083-9","volume":"33","author":"A Broder","year":"2000","unstructured":"Broder, A., Kumar, R., Maghoul, F., Raghavan, P., Rajagopalan, S., Stata, R., Tomkins, A., Wiener, J.: Graph Structure in the Web. Computer Networks: The International Journal of Computer and Telecommunications Networking 33(1\u20136), 309\u2013320 (2000)","journal-title":"Computer Networks: The International Journal of Computer and Telecommunications Networking"},{"issue":"2","key":"5_CR4","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/S0166-218X(00)00281-X","volume":"113","author":"DG Corneil","year":"2001","unstructured":"Corneil, D.G., Dragan, F.F., Habib, M., Paul, C.: Diameter Determination on Restricted Graph Families. Discrete Applied Mathematics 113(2), 143\u2013166 (2001)","journal-title":"Discrete Applied Mathematics"},{"key":"5_CR5","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1016\/j.tcs.2012.09.018","volume":"514","author":"P Crescenzi","year":"2013","unstructured":"Crescenzi, P., Grossi, R., Habib, M., Lanzi, L., Marino, A.: On Computing the Diameter of Real-World Undirected Graphs. Theoretical Computer Science 514, 84\u201395 (2013)","journal-title":"Theoretical Computer Science"},{"key":"5_CR6","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. In: de Berg, M., Meyer, U. (eds.) ESA 2010, Part I. LNCS, vol. 6346, pp. 302\u2013313. Springer, Heidelberg (2010)"},{"key":"5_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/978-3-642-30850-5_10","volume-title":"Experimental Algorithms","author":"P Crescenzi","year":"2012","unstructured":"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\u2013110. Springer, Heidelberg (2012)"},{"issue":"3","key":"5_CR8","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1287\/trsc.7.3.287","volume":"7","author":"GY Handler","year":"1973","unstructured":"Handler, G.Y.: Minimax Location of a Facility in an Undirected Tree Graph. Transportation Science 7(3), 287\u2013293 (1973)","journal-title":"Transportation Science"},{"key":"5_CR9","unstructured":"Leskovec, J., Krevl, A.: SNAP Datasets: Stanford Large Network Dataset Collection. http:\/\/snap.stanford.edu\/data"},{"issue":"10","key":"5_CR10","first-page":"1.10","volume":"13","author":"C Magnien","year":"2009","unstructured":"Magnien, C., Latapy, M., Habib, M.: Fast Computation of Empirically Tight Bounds for the Diameter of Massive Graphs. Journal of Experimental Algorithmics 13(10), 1.10\u20131.9 (2009)","journal-title":"Journal of Experimental Algorithmics"},{"issue":"1","key":"5_CR11","first-page":"60","volume":"2","author":"S Milgram","year":"1967","unstructured":"Milgram, S.: The Small-World Problem. Psychology Today 2(1), 60\u201367 (1967)","journal-title":"Psychology Today"},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"Takes, F.W., Kosters, W.A.: Determining the Diameter of Small World Networks. In: CIKM, pp. 1191\u20131196 (2011)","DOI":"10.1145\/2063576.2063748"},{"issue":"2","key":"5_CR13","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"R Tarjan","year":"1972","unstructured":"Tarjan, R.: Depth-First Search and Linear Graph Algorithms. SIAM Journal on Computing 1(2), 146\u2013160 (1972)","journal-title":"SIAM Journal on Computing"},{"issue":"6684","key":"5_CR14","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"DJ Watts","year":"1998","unstructured":"Watts, D.J., Strogatz, S.H.: Collective Dynamics of \u2019Small-World\u2019 Networks. Nature 393(6684), 440\u2013442 (1998)","journal-title":"Nature"}],"container-title":["Lecture Notes in Computer Science","Experimental Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-20086-6_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T01:38:15Z","timestamp":1676943495000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-20086-6_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319200859","9783319200866"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-20086-6_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"20 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}