{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:47:05Z","timestamp":1759063625650},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319078892"},{"type":"electronic","value":"9783319078908"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-07890-8_5","type":"book-chapter","created":{"date-parts":[[2014,5,28]],"date-time":"2014-05-28T12:08:51Z","timestamp":1401278931000},"page":"52-63","source":"Crossref","is-referenced-by-count":7,"title":["On the Solvability of the Six Degrees of Kevin Bacon Game"],"prefix":"10.1007","author":[{"given":"Michele","family":"Borassi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pierluigi","family":"Crescenzi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michel","family":"Habib","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Walter","family":"Kosters","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrea","family":"Marino","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frank","family":"Takes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"6","key":"5_CR1","doi-asserted-by":"publisher","first-page":"725","DOI":"10.1121\/1.1906679","volume":"22","author":"A. Bavelas","year":"1950","unstructured":"Bavelas, A.: Communication Patterns in Task-Oriented Groups. The Journal of the Acoustical Society of America\u00a022(6), 725\u2013730 (1950)","journal-title":"The Journal of the Acoustical Society of America"},{"issue":"1-6","key":"5_CR2","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/S1389-1286(00)00083-9","volume":"33","author":"A.Z. Broder","year":"2000","unstructured":"Broder, A.Z., Kumar, R., Maghoul, F., Raghavan, P., Rajagopalan, S., Stata, R., Tomkins, A., Wiener, J.L.: Graph Structure in the Web. Computer Networks\u00a033(1-6), 309\u2013320 (2000)","journal-title":"Computer Networks"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Chechik, S., Larkin, D., Roditty, L., Schoenebeck, G., Tarjan, R.E., Williams, V.V.: Better approximation algorithms for the graph diameter. In: SODA, pp. 1041\u20131052 (2014)","DOI":"10.1137\/1.9781611973402.78"},{"key":"5_CR4","unstructured":"Clemesha, A.: The Wiki Game (2013), \n                  \n                    http:\/\/thewikigame.com"},{"key":"5_CR5","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.\u00a07276, pp. 99\u2013110. Springer, Heidelberg (2012)"},{"key":"5_CR6","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. Theor. Comput. Sci.\u00a0514, 84\u201395 (2013)","journal-title":"Theor. Comput. Sci."},{"key":"5_CR7","unstructured":"Gurevich, M.: The Social Structure of Acquaintanceship Networks, PhD Thesis (1961)"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Kleinberg, J.M., Faloutsos, C.: Graph Evolution: Densification and Shrinking Diameters. TKDD\u00a01(1) (2007)","DOI":"10.1145\/1217299.1217301"},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"Magnien, C., Latapy, M., Habib, M.: Fast Computation of Empirically Tight Bounds for the Diameter of Massive Graphs. Journal of Experimental Algorithmics\u00a013 (2009)","DOI":"10.1145\/1412228.1455266"},{"key":"5_CR10","unstructured":"Marino, A.: Algorithms for Biological Graphs: Analysis and Enumeration, PhD Thesis, Dipartimento di Sistemi e Informatica, University of Florence (2013)"},{"key":"5_CR11","first-page":"60","volume":"2","author":"S. Milgram","year":"1967","unstructured":"Milgram, S.: The Small World Problem. Psychology Today\u00a02, 60\u201367 (1967)","journal-title":"Psychology Today"},{"key":"5_CR12","unstructured":"Reynolds, P.: The Oracle of Kevin Bacon (2013), \n                  \n                    http:\/\/oracleofbacon.org"},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"Roditty, L., Williams, V.V.: Fast Approximation Algorithms for the Diameter and Radius of Sparse Graphs. In: STOC, pp. 515\u2013524 (2013)","DOI":"10.1145\/2488608.2488673"},{"key":"5_CR14","unstructured":"SNAP: Stanford Network Analysis Package (SNAP) Website (2009), \n                  \n                    http:\/\/snap.stanford.edu"},{"key":"5_CR15","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":"1","key":"5_CR16","doi-asserted-by":"publisher","first-page":"100","DOI":"10.3390\/a6010100","volume":"6","author":"F.W. Takes","year":"2013","unstructured":"Takes, F.W., Kosters, W.A.: Computing the Eccentricity Distribution of Large Graphs. Algorithms\u00a06(1), 100\u2013118 (2013)","journal-title":"Algorithms"},{"key":"5_CR17","unstructured":"Thompson, K., Bordwell, D.: Film History: an Introduction. McGraw-Hill Higher Education (2009)"}],"container-title":["Lecture Notes in Computer Science","Fun with Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-07890-8_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T22:57:53Z","timestamp":1578524273000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-07890-8_5"}},"subtitle":["A Faster Graph Diameter and Radius Computation Method"],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319078892","9783319078908"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07890-8_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}