{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T21:07:18Z","timestamp":1743109638961,"version":"3.40.3"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030934088"},{"type":"electronic","value":"9783030934095"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-030-93409-5_17","type":"book-chapter","created":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T03:18:22Z","timestamp":1641007102000},"page":"194-206","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Fellow Travelers Phenomenon Present in\u00a0Real-World Networks"],"prefix":"10.1007","author":[{"given":"Abdulhakeem O.","family":"Mohammed","sequence":"first","affiliation":[]},{"given":"Feodor F.","family":"Dragan","sequence":"additional","affiliation":[]},{"given":"Heather M.","family":"Guarnera","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,1,1]]},"reference":[{"issue":"1","key":"17_CR1","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1002\/net.21631","volume":"67","author":"M Abu-Ata","year":"2016","unstructured":"Abu-Ata, M., Dragan, F.F.: Metric tree-like structures in real-world networks: an empirical study. Networks 67(1), 49\u201368 (2016)","journal-title":"Networks"},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"Adcock, A.B., Sullivan, B.D., Mahoney, M.W.: Tree-like structure in large social and information networks. In: 13th ICDM 2013, pp. 1\u201310. IEEE (2013)","DOI":"10.1109\/ICDM.2013.77"},{"key":"17_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/978-3-662-48350-3_19","volume-title":"Algorithms - ESA 2015","author":"M Borassi","year":"2015","unstructured":"Borassi, M., Coudert, D., Crescenzi, P., Marino, A.: On computing the hyperbolicity of real-world graphs. In: Bansal, N., Finocchi, I. (eds.) ESA 2015. LNCS, vol. 9294, pp. 215\u2013226. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48350-3_19"},{"key":"17_CR4","series-title":"Grundlehren der mathematischen Wissenschaften","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-12494-9","volume-title":"Metric Spaces of Non-Positive Curvature","author":"M Bridson","year":"1999","unstructured":"Bridson, M., Haefliger, A.: Metric Spaces of Non-Positive Curvature. Grundlehren der mathematischen Wissenschaften, vol. 319. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/978-3-662-12494-9"},{"key":"17_CR5","unstructured":"Center for Applied Internet Data Analysis (CAIDA). CAIDA AS Relationships Dataset (2017). http:\/\/www.caida.org\/data\/active\/as-relationships\/"},{"issue":"3","key":"17_CR6","doi-asserted-by":"publisher","first-page":"856","DOI":"10.1007\/s00454-019-00107-9","volume":"65","author":"J Chalopin","year":"2021","unstructured":"Chalopin, J., Chepoi, V., Dragan, F.F., Ducoffe, G., Mohammed, A., Vax\u00e8s, Y.: Fast approximation and exact computation of negative curvature parameters of graphs. Discret. Comput. Geom. 65(3), 856\u2013892 (2021)","journal-title":"Discret. Comput. Geom."},{"issue":"4","key":"17_CR7","doi-asserted-by":"publisher","first-page":"1987","DOI":"10.1137\/130941328","volume":"28","author":"J Chalopin","year":"2014","unstructured":"Chalopin, J., Chepoi, V., Papasoglu, P., Pecatte, T.: Cop and robber game and hyperbolicity. SIAM J. Discret. Math. 28(4), 1987\u20132007 (2014)","journal-title":"SIAM J. Discret. Math."},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"Chepoi, V., Dragan, F., Estellon, B., Habib, M., Vax\u00e8s, Y.: Diameters, centers, and approximating trees of $$\\delta $$-hyperbolic geodesic spaces and graphs. In: Proceedings of the 24th Annual Symposium on Computational Geometry, pp. 59\u201368. ACM (2008)","DOI":"10.1145\/1377676.1377687"},{"issue":"3\u20134","key":"17_CR9","doi-asserted-by":"publisher","first-page":"713","DOI":"10.1007\/s00453-010-9478-x","volume":"62","author":"V Chepoi","year":"2012","unstructured":"Chepoi, V., Dragan, F.F., Estellon, B., Habib, M., Vax\u00e8s, Y., Xiang, Y.: Additive spanners and distance and routing labeling schemes for hyperbolic graphs. Algorithmica 62(3\u20134), 713\u2013732 (2012)","journal-title":"Algorithmica"},{"key":"17_CR10","doi-asserted-by":"crossref","unstructured":"Chepoi, V., Dragan, F.F., Vaxes, Y.: Core congestion is inherent in hyperbolic networks. In: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 2264\u20132279. SIAM (2017)","DOI":"10.1137\/1.9781611974782.149"},{"key":"17_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/978-3-540-74208-1_5","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"V Chepoi","year":"2007","unstructured":"Chepoi, V., Estellon, B.: Packing and covering $$\\delta $$-hyperbolic spaces by balls. In: Charikar, M., Jansen, K., Reingold, O., Rolim, J.D.P. (eds.) APPROX\/RANDOM -2007. LNCS, vol. 4627, pp. 59\u201373. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74208-1_5"},{"key":"17_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2780652","volume":"20","author":"N Cohen","year":"2015","unstructured":"Cohen, N., Coudert, D., Lancin, A.: On computing the Gromov hyperbolicity. J. Exp. Algorithmics (JEA) 20, 1\u20136 (2015)","journal-title":"J. Exp. Algorithmics (JEA)"},{"issue":"4","key":"17_CR13","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1002\/net.10098","volume":"42","author":"DG Corneil","year":"2003","unstructured":"Corneil, D.G., Dragan, F.F., K\u00f6hler, E.: On the power of BFS to determine a graph\u2019s diameter. Networks 42(4), 209\u2013222 (2003)","journal-title":"Networks"},{"key":"17_CR14","unstructured":"Coudert, D.: Gromov hyperbolicity of graphs: C source code (2014). http:\/\/www-sop.inria.fr\/members\/David.Coudert\/code\/hyperbolicity.shtml"},{"issue":"2","key":"17_CR15","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1016\/j.disc.2018.10.017","volume":"342","author":"FF Dragan","year":"2019","unstructured":"Dragan, F.F., Guarnera, H.M.: Obstructions to a small hyperbolicity in Helly graphs. Discret. Math. 342(2), 326\u2013338 (2019)","journal-title":"Discret. Math."},{"key":"17_CR16","unstructured":"Dragan, F.F., Mohammed, A.: Slimness of graphs. Discret. Math. Theor. Comput. Sci. 21(3) (2019)"},{"key":"17_CR17","doi-asserted-by":"crossref","unstructured":"Duan, R.: Approximation algorithms for the Gromov hyperbolicity of discrete metric spaces. In: LATIN, pp. 285\u2013293 (2014)","DOI":"10.1007\/978-3-642-54423-1_25"},{"key":"17_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/978-3-319-49787-7_6","volume-title":"Algorithms and Models for the Web Graph","author":"K Edwards","year":"2016","unstructured":"Edwards, K., Kennedy, S., Saniee, I.: Fast approximation algorithms for p-centers in large $$\\delta $$-hyperbolic graphs. In: Bonato, A., Graham, F.C., Pra\u0142at, P. (eds.) WAW 2016. LNCS, vol. 10088, pp. 60\u201373. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-49787-7_6"},{"key":"17_CR19","unstructured":"Fournier, H., Ismail, A., Vigneron, A.: Computing the Gromov hyperbolicity of a discrete metric space. eprint arXiv:1210.3323 (2012)"},{"key":"17_CR20","doi-asserted-by":"crossref","unstructured":"Ghys, E., de la Harpe, P. (eds.): Sur les groupes hyperboliques d\u2019apr\u00e8s M. Gromov. Progress in Mathematics, vol. 83 (1990)","DOI":"10.1007\/978-1-4684-9167-8"},{"key":"17_CR21","first-page":"75","volume":"8","author":"M Gromov","year":"1987","unstructured":"Gromov, M.: Hyperbolic groups: essays in group theory. MSRI 8, 75\u2013263 (1987)","journal-title":"MSRI"},{"key":"17_CR22","unstructured":"Jon Kleinberg. Jon Kleinberg\u2019s web page. http:\/\/www.cs.cornell.edu\/courses\/cs685\/2002fa\/"},{"issue":"1","key":"17_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1080\/15427951.2010.554320","volume":"7","author":"EA Jonckheere","year":"2011","unstructured":"Jonckheere, E.A., Lou, M., Bonahon, F., Baryshnikov, Y.: Euclidean versus hyperbolic congestion in idealized versus experimental networks. Internet Math. 7(1), 1\u201327 (2011)","journal-title":"Internet Math."},{"key":"17_CR24","doi-asserted-by":"crossref","unstructured":"Kennedy, W.S., Saniee, I., Narayan, O.: On the hyperbolicity of large-scale networks and its estimation. In: 2016 IEEE International Conference on Big Data (Big Data), pp. 3344\u20133351. IEEE (2016)","DOI":"10.1109\/BigData.2016.7840994"},{"key":"17_CR25","doi-asserted-by":"crossref","unstructured":"Krauthgamer, R., Lee, J.R.: Algorithms on negatively curved spaces. In: 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), pp. 119\u2013132. IEEE (2006)","DOI":"10.1109\/FOCS.2006.9"},{"key":"17_CR26","doi-asserted-by":"crossref","unstructured":"Kunegis, J.: Konect: the Koblenz network collection. In: WWW 2013 Companion, pp. 1343\u20131350. Association for Computing Machinery, New York (2013)","DOI":"10.1145\/2487788.2488173"},{"issue":"6","key":"17_CR27","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.84.066108","volume":"84","author":"O Narayan","year":"2011","unstructured":"Narayan, O., Saniee, I.: Large-scale curvature of networks. Phys. Rev. E 84(6), 066108 (2011)","journal-title":"Phys. Rev. E"},{"issue":"5","key":"17_CR28","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1145\/1096536.1096546","volume":"35","author":"Y Shavitt","year":"2005","unstructured":"Shavitt, Y., Shir, E.: DIMES: let the internet measure itself. ACM SIGCOMM Comput. Commun. Rev. 35(5), 71\u201374 (2005)","journal-title":"ACM SIGCOMM Comput. Commun. Rev."},{"issue":"1","key":"17_CR29","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1109\/TNET.2007.899021","volume":"16","author":"Y Shavitt","year":"2008","unstructured":"Shavitt, Y., Tankel, T.: Hyperbolic embedding of internet graph for distance estimation and overlay construction. IEEE\/ACM Trans. Netw. 16(1), 25\u201336 (2008)","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"17_CR30","unstructured":"Stanford Large Network Dataset Collection (SNAP). Stanford large network dataset. http:\/\/snap.stanford.edu\/data\/index.html"},{"key":"17_CR31","unstructured":"Vladimir Batagelj. Pajek datasets. http:\/\/vlado.fmf.uni-lj.si\/pub\/networks\/data\/"},{"key":"17_CR32","doi-asserted-by":"crossref","unstructured":"Wu, Y., Zhang, C.: Hyperbolicity and chordality of a graph. Electr. J. Comb. 18(1), Paper #P43 (2011)","DOI":"10.37236\/530"}],"container-title":["Studies in Computational Intelligence","Complex Networks & Their Applications X"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-93409-5_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,27]],"date-time":"2023-04-27T20:33:14Z","timestamp":1682627594000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-93409-5_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030934088","9783030934095"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-93409-5_17","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"1 January 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COMPLEX NETWORKS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Complex Networks and Their Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Madrid","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 November 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 December 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwcna2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.complexnetworks.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}