{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,4]],"date-time":"2025-04-04T11:24:51Z","timestamp":1743765891842},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319445427"},{"type":"electronic","value":"9783319445434"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-44543-4_9","type":"book-chapter","created":{"date-parts":[[2016,8,8]],"date-time":"2016-08-08T07:49:58Z","timestamp":1470642598000},"page":"109-121","source":"Crossref","is-referenced-by-count":10,"title":["Distance Queries in Large-Scale Fully Dynamic Complex Networks"],"prefix":"10.1007","author":[{"given":"Gianlorenzo","family":"D\u2019Angelo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mattia","family":"D\u2019Emidio","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniele","family":"Frigioni","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,8,9]]},"reference":[{"key":"9_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1007\/978-3-642-33090-2_4","volume-title":"Algorithms \u2013 ESA 2012","author":"I Abraham","year":"2012","unstructured":"Abraham, I., Delling, D., Goldberg, A.V., Werneck, R.F.: Hierarchical hub labelings for shortest paths. In: Epstein, L., Ferragina, P. (eds.) ESA 2012. LNCS, vol. 7501, pp. 24\u201335. Springer, Heidelberg (2012)"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"Akiba, T., Iwata, Y., Yoshida, Y.: Fast exact shortest-path distance queries on large networks by pruned landmark labeling. In: Proceedings of International Conference on Management of Data (SIGMOD 2013), pp. 349\u2013360. ACM (2013)","DOI":"10.1145\/2463676.2465315"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"Akiba, T., Iwata, Y., Yoshida, Y.: Dynamic and historical shortest-path distance queries on large evolving networks by pruned landmark labeling. In: Proceedings of 23rd International World Wide Web Conference (WWW 2014), pp. 237\u2013248. ACM (2014)","DOI":"10.1145\/2566486.2568007"},{"issue":"4\u20135","key":"9_CR4","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/j.physrep.2005.10.009","volume":"424","author":"S Boccaletti","year":"2006","unstructured":"Boccaletti, S., Latora, V., Moreno, Y., Chavez, M., Hwang, D.U.: Complex networks: structure and dynamics. Phys. Rep. 424(4\u20135), 175\u2013308 (2006)","journal-title":"Phys. Rep."},{"issue":"4","key":"9_CR5","doi-asserted-by":"crossref","first-page":"709","DOI":"10.1007\/s11786-007-0023-5","volume":"1","author":"F Bruera","year":"2008","unstructured":"Bruera, F., Cicerone, S., D\u2019Angelo, G., Stefano, G.D., Frigioni, D.: Dynamic multi-level overlay graphs for shortest paths. Math. Comput. Sci. 1(4), 709\u2013736 (2008)","journal-title":"Math. Comput. Sci."},{"key":"9_CR6","unstructured":"Cionini, A., D\u2019Angelo, G., D\u2019Emidio, M., Frigioni, D., Giannakopoulou, K., Paraskevopoulos, A., Zaroliagis, C.D.: Engineering graph-based models for dynamic timetable information systems. In: ATMOS. OASICS, vol. 42, pp. 46\u201361. Schloss Dagstuhl (2014)"},{"key":"9_CR7","unstructured":"Cohen, E., Halperin, E., Kaplan, H., Zwick, U.: Reachability and distance queries via 2-hop labels. In: Proceedings of the 13th ACM-SIAM Symposium on Discrete Algorithms (SODA 2002), pp. 937\u2013946. ACM\/SIAM (2002)"},{"issue":"3","key":"9_CR8","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1002\/net.21542","volume":"63","author":"G D\u2019Angelo","year":"2014","unstructured":"D\u2019Angelo, G., D\u2019Emidio, M., Frigioni, D.: Fully dynamic update of arc-flags. Networks 63(3), 243\u2013259 (2014)","journal-title":"Networks"},{"key":"9_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/978-3-662-44777-2_27","volume-title":"Algorithms - ESA 2014","author":"D Delling","year":"2014","unstructured":"Delling, D., Goldberg, A.V., Pajor, T., Werneck, R.F.: Robust distance queries on massive networks. In: Schulz, A.S., Wagner, D. (eds.) ESA 2014. LNCS, vol. 8737, pp. 321\u2013333. Springer, Heidelberg (2014)"},{"key":"9_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1007\/978-3-642-20662-7_32","volume-title":"Experimental Algorithms","author":"D Delling","year":"2011","unstructured":"Delling, D., Goldberg, A.V., Pajor, T., Werneck, R.F.: Customizable route planning. In: Pardalos, P.M., Rebennack, S. (eds.) SEA 2011. LNCS, vol. 6630, pp. 376\u2013387. Springer, Heidelberg (2011)"},{"key":"9_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1007\/978-3-319-07959-2_22","volume-title":"Experimental Algorithms","author":"D Delling","year":"2014","unstructured":"Delling, D., Goldberg, A.V., Savchenko, R., Werneck, R.F.: Hub labels: theory and practice. In: Gudmundsson, J., Katajainen, J. (eds.) SEA 2014. LNCS, vol. 8504, pp. 259\u2013270. Springer, Heidelberg (2014)"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"Delling, D., Italiano, G.F., Pajor, T., Santaroni, F.: Better transit routing by exploiting vehicle GPS data. In: Proceedings of the 7th SIGSPATIAL International Workshop on Computational Transportation Science (IWCTS 2014), pp. 31\u201340. ACM (2014)","DOI":"10.1145\/2674918.2674923"},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"Jin, R., Ruan, N., Xiang, Y., Lee, V.E.: A highway-centric labeling approach for answering distance queries on large sparse graphs. In: Proceedings of International Conference on Management of Data (SIGMOD 2012), pp. 445\u2013456. ACM (2012)","DOI":"10.1145\/2213836.2213887"},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"Potamias, M., Bonchi, F., Castillo, C., Gionis, A.: Fast shortest path distance estimation in large networks. In: Proceedings of 18th ACM Conference on Information and Knowledge Management (CIKM 2009), pp. 867\u2013876. ACM (2009)","DOI":"10.1145\/1645953.1646063"},{"key":"9_CR15","unstructured":"Qin, Y., Sheng, Q.Z., Zhang, W.E.: SIEF: efficiently answering distance queries for failure prone graphs. In: Proceedings of the 18th International Conference on Extending Database Technology (EDBT 2015), pp. 145\u2013156. OpenProceedings.org (2015)"},{"key":"9_CR16","doi-asserted-by":"crossref","unstructured":"Vieira, M.V., Fonseca, B.M., Damazio, R., Golgher, P.B., de Castro Reis, D., Ribeiro-Neto, B.A.: Efficient search ranking in social networks. In: Proceedings of the 16th Conference on Information and Knowledge Management (CIKM 2007), pp. 563\u2013572. ACM (2007)","DOI":"10.1145\/1321440.1321520"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-44543-4_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T16:11:12Z","timestamp":1498320672000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-44543-4_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319445427","9783319445434"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-44543-4_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}