{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,10]],"date-time":"2025-04-10T12:32:20Z","timestamp":1744288340313,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030618339"},{"type":"electronic","value":"9783030618346"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-61834-6_19","type":"book-chapter","created":{"date-parts":[[2020,10,7]],"date-time":"2020-10-07T04:33:06Z","timestamp":1602045186000},"page":"222-229","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A Simple Yet Effective Algorithm to Compute Incremental All-Pairs Shortest Distances"],"prefix":"10.1007","author":[{"given":"Arturo","family":"Verbel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nestor","family":"Rodriguez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sergio","family":"Rojas\u2013Galeano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,10,8]]},"reference":[{"issue":"1","key":"19_CR1","first-page":"347","volume":"15","author":"M Alshammari","year":"2020","unstructured":"Alshammari, M., Rezgui, A.: An all pairs shortest path algorithm for dynamic graphs. Comput. Sci. 15(1), 347\u2013365 (2020)","journal-title":"Comput. Sci."},{"key":"19_CR2","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1016\/j.measurement.2014.10.014","volume":"60","author":"MK Ardakani","year":"2015","unstructured":"Ardakani, M.K., Tavana, M.: A decremental approach with the A* algorithm for speeding-up the optimization process in dynamic shortest path problems. Measurement 60, 299\u2013307 (2015)","journal-title":"Measurement"},{"issue":"4","key":"19_CR3","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1016\/0196-6774(91)90036-X","volume":"12","author":"G Ausiello","year":"1991","unstructured":"Ausiello, G., Italiano, G.F., Spaccamela, A.M., Nanni, U.: Incremental algorithms for minimal length paths. J. Algorithms 12(4), 615\u2013638 (1991)","journal-title":"J. Algorithms"},{"doi-asserted-by":"crossref","unstructured":"Bergamini, E., Meyerhenke, H., Staudt, C.: Approximating betweenness centrality in large evolving networks. In: ALENEX, pp. 133\u2013146. SIAM (2015)","key":"19_CR4","DOI":"10.1137\/1.9781611973754.12"},{"issue":"2","key":"19_CR5","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1287\/trsc.2014.0579","volume":"51","author":"D Delling","year":"2017","unstructured":"Delling, D., Goldberg, A.V., Pajor, T., Werneck, R.F.: Customizable route planning in road networks. Transp. Sci. 51(2), 566\u2013591 (2017)","journal-title":"Transp. Sci."},{"key":"19_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/978-3-642-02094-0_7","volume-title":"Algorithmics of Large and Complex Networks","author":"D Delling","year":"2009","unstructured":"Delling, D., Sanders, P., Schultes, D., Wagner, D.: Engineering route planning algorithms. In: Lerner, J., Wagner, D., Zweig, K.A. (eds.) Algorithmics of Large and Complex Networks. LNCS, vol. 5515, pp. 117\u2013139. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02094-0_7"},{"issue":"4","key":"19_CR7","doi-asserted-by":"publisher","first-page":"578","DOI":"10.1145\/1198513.1198519","volume":"2","author":"C Demetrescu","year":"2006","unstructured":"Demetrescu, C., Italiano, G.F.: Experimental analysis of dynamic all pairs shortest path algorithms. ACM Trans. Algorithms (TALG) 2(4), 578\u2013601 (2006)","journal-title":"ACM Trans. Algorithms (TALG)"},{"key":"19_CR8","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A note on two problems in connection with graphs. Numer. Math. 1, 269\u2013271 (1959)","journal-title":"Numer. Math."},{"issue":"3","key":"19_CR9","first-page":"259","volume":"24","author":"CE Dunn","year":"1992","unstructured":"Dunn, C.E., Newton, D.: Optimal routes in GIS and emergency planning applications. Area 24(3), 259\u2013267 (1992)","journal-title":"Area"},{"key":"19_CR10","first-page":"371","volume":"49","author":"S Even","year":"1985","unstructured":"Even, S., Gazit, H.: Updating distances in dynamic graphs. Methods Oper. Res. 49, 371\u2013387 (1985)","journal-title":"Methods Oper. Res."},{"doi-asserted-by":"crossref","unstructured":"Floyd, R.W.: Algorithm 97: shortest path. Commun. ACM 5(6), 345+ (1962)","key":"19_CR11","DOI":"10.1145\/367766.368168"},{"doi-asserted-by":"crossref","unstructured":"Henzinger, M., Krinninger, S., Nanongkai, D.: Decremental single-source shortest paths on undirected graphs in near-linear total update time. In: 2014 IEEE 55th Annual Symposium on Foundations of Computer Science (FOCS), pp. 146\u2013155. IEEE (2014)","key":"19_CR12","DOI":"10.1109\/FOCS.2014.24"},{"doi-asserted-by":"crossref","unstructured":"Keeling, M.J., Deirdre Hollingsworth, T., Read, J.M.: The efficacy of contact tracing for the containment of the 2019 novel coronavirus (COVID-19). medRxiv (2020)","key":"19_CR13","DOI":"10.1101\/2020.02.14.20023036"},{"issue":"1","key":"19_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s13278-014-0220-6","volume":"4","author":"SS Khopkar","year":"2014","unstructured":"Khopkar, S.S., Nagi, R., Nikolaev, A.G., Bhembre, V.: Efficient algorithms for incremental all pairs shortest paths, closeness and betweenness in social network analysis. Soc. Netw. Anal. Min. 4(1), 1\u201320 (2014). https:\/\/doi.org\/10.1007\/s13278-014-0220-6","journal-title":"Soc. Netw. Anal. Min."},{"key":"19_CR15","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/j.tcs.2014.06.035","volume":"561","author":"A Lissovoi","year":"2015","unstructured":"Lissovoi, A., Witt, C.: Runtime analysis of ant colony optimization on dynamic shortest path problems. Theoret. Comput. Sci. 561, 73\u201385 (2015)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"19_CR16","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/s11235-015-9979-7","volume":"62","author":"J Liu","year":"2015","unstructured":"Liu, J., Wan, J., Wang, Q., Deng, P., Zhou, K., Qiao, Y.: A survey on position-based routing for vehicular ad hoc networks. Telecommun. Syst. 62(1), 15\u201330 (2015). https:\/\/doi.org\/10.1007\/s11235-015-9979-7","journal-title":"Telecommun. Syst."},{"key":"19_CR17","volume-title":"OSPF: Anatomy of an Internet Routing Protocol","author":"JT Moy","year":"1998","unstructured":"Moy, J.T.: OSPF: Anatomy of an Internet Routing Protocol. Addison-Wesley Longman Publishing Co., Inc., Boston (1998)"},{"issue":"2","key":"19_CR18","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1006\/jagm.1996.0046","volume":"21","author":"G Ramalingam","year":"1996","unstructured":"Ramalingam, G., Reps, T.: An incremental algorithm for a generalization of the shortest-path problem. J. Algorithms 21(2), 267\u2013305 (1996)","journal-title":"J. Algorithms"},{"key":"19_CR19","series-title":"Studies in Big Data","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/978-3-319-26989-4_10","volume-title":"Big Data Analysis: New Algorithms for a New Society","author":"R Sarmento","year":"2016","unstructured":"Sarmento, R., Oliveira, M., Cordeiro, M., Tabassum, S., Gama, J.: Social network analysis in streaming call graphs. In: Japkowicz, N., Stefanowski, J. (eds.) Big Data Analysis: New Algorithms for a New Society. SBD, vol. 16, pp. 239\u2013261. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-26989-4_10"},{"unstructured":"Slobbe, A., Bergamini, E., Meyerhenke, H.: Faster incremental all-pairs shortest paths. Technical report, Karlsruhe Institute of Technology, Faculty of Informatics (2016)","key":"19_CR20"}],"container-title":["Communications in Computer and Information Science","Applied Computer Sciences in Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-61834-6_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,24]],"date-time":"2021-04-24T09:23:23Z","timestamp":1619256203000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-61834-6_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030618339","9783030618346"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-61834-6_19","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"8 October 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WEA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Workshop on Engineering Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bogota","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Colombia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 October 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 October 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"woea2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/ieee.udistrital.edu.co\/wea2020","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"136","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"32","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"12","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"24% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.68","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.41","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Due to the COVID-19 pandemic the conference was held online","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}