{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T11:36:28Z","timestamp":1725795388060},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319079585"},{"type":"electronic","value":"9783319079592"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-07959-2_24","type":"book-chapter","created":{"date-parts":[[2014,6,10]],"date-time":"2014-06-10T12:44:25Z","timestamp":1402404265000},"page":"283-294","source":"Crossref","is-referenced-by-count":7,"title":["Experimental Evaluation of Dynamic Shortest Path Tree Algorithms on Homogeneous Batches"],"prefix":"10.1007","author":[{"given":"Annalisa","family":"D\u2019Andrea","sequence":"first","affiliation":[]},{"given":"Mattia","family":"D\u2019Emidio","sequence":"additional","affiliation":[]},{"given":"Daniele","family":"Frigioni","sequence":"additional","affiliation":[]},{"given":"Stefano","family":"Leucci","sequence":"additional","affiliation":[]},{"given":"Guido","family":"Proietti","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"24_CR1","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"R. Albert","year":"1999","unstructured":"Albert, R., Barab\u00e1si, A.L.: Emergence of scaling in random networks. Science\u00a0286, 509\u2013512 (1999)","journal-title":"Science"},{"key":"24_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/978-3-642-02011-7_7","volume-title":"Experimental Algorithms","author":"R. Bauer","year":"2009","unstructured":"Bauer, R., Wagner, D.: Batch dynamic single-source shortest-path algorithms: An experimental study. In: Vahrenhold, J. (ed.) SEA 2009. LNCS, vol.\u00a05526, pp. 51\u201362. Springer, Heidelberg (2009)"},{"key":"24_CR3","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511814068","volume-title":"Random Graphs","author":"B. Bollob\u00e1s","year":"2001","unstructured":"Bollob\u00e1s, B.: Random Graphs. Cambridge University Press, Cambridge (2001)"},{"issue":"4","key":"24_CR4","doi-asserted-by":"publisher","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., Di Stefano, G., Frigioni, D.: Dynamic multi-level overlay graphs for shortest paths. Math. Comput. Sci.\u00a01(4), 709\u2013736 (2008)","journal-title":"Math. Comput. Sci."},{"issue":"58","key":"24_CR5","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1109\/TC.2008.198","volume":"4","author":"E. Chan","year":"2009","unstructured":"Chan, E., Yang, Y.: Shortest path tree computation in dynamic graphs. IEEE Trans. Comput.\u00a04(58), 541\u2013557 (2009)","journal-title":"IEEE Trans. Comput."},{"key":"24_CR6","doi-asserted-by":"publisher","first-page":"1013","DOI":"10.1016\/j.tcs.2009.11.008","volume":"411","author":"S. Cicerone","year":"2010","unstructured":"Cicerone, S., D\u2019Angelo, G., Di Stefano, G., Frigioni, D.: Partially dynamic efficient algorithms for distributed shortest paths. Theoret. Comput. Sci.\u00a0411, 1013\u20131037 (2010)","journal-title":"Theoret. Comput. Sci."},{"key":"24_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1007\/978-3-319-03578-9_24","volume-title":"Structural Information and Communication Complexity","author":"A. D\u2019Andrea","year":"2013","unstructured":"D\u2019Andrea, A., D\u2019Emidio, M., Frigioni, D., Leucci, S., Proietti, G.: Dynamically maintaining shortest path trees under batches of updates. In: Moscibroda, T., Rescigno, A.A. (eds.) SIROCCO 2013. LNCS, vol.\u00a08179, pp. 286\u2013297. Springer, Heidelberg (2013)"},{"key":"24_CR8","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"E.W. Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A note on two problems in connexion with graphs. Numer. Math.\u00a01, 269\u2013271 (1959)","journal-title":"Numer. Math."},{"issue":"3","key":"24_CR9","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1007\/PL00009224","volume":"22","author":"D. Frigioni","year":"1998","unstructured":"Frigioni, D., Marchetti-Spaccamela, A., Nanni, U.: Semidynamic algorithms for maintaining single source shortest paths trees. Algorithmica\u00a022(3), 250\u2013274 (1998)","journal-title":"Algorithmica"},{"issue":"2","key":"24_CR10","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1006\/jagm.1999.1048","volume":"34","author":"D. Frigioni","year":"2000","unstructured":"Frigioni, D., Marchetti-Spaccamela, A., Nanni, U.: Fully dynamic algorithms for maintaining shortest paths trees. J. Algorithms\u00a034(2), 251\u2013281 (2000)","journal-title":"J. Algorithms"},{"issue":"1","key":"24_CR11","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/S0196-6774(03)00082-8","volume":"49","author":"D. Frigioni","year":"2003","unstructured":"Frigioni, D., Marchetti-Spaccamela, A., Nanni, U.: Fully dynamic shortest paths in digraphs with arbitrary arc weights. J. Algorithms\u00a049(1), 86\u2013113 (2003)","journal-title":"J. Algorithms"},{"key":"24_CR12","unstructured":"Hyun, Y., Huffaker, B., Andersen, D., Aben, E., Shannon, C., Luckie, M., Claffy, K.: The CAIDA IPv4 routed\/24 topology dataset, \n                    \n                      http:\/\/www.caida.org\/data\/active\/ipv4_routed_24_topology_dataset.xml"},{"issue":"6","key":"24_CR13","doi-asserted-by":"publisher","first-page":"734","DOI":"10.1109\/90.893870","volume":"8","author":"P. Narv\u00e1ez","year":"2000","unstructured":"Narv\u00e1ez, P., Siu, K.Y., Tzeng, H.Y.: New dynamic algorithms for shortest path tree computation. IEEE\/ACM Trans. Netw.\u00a08(6), 734\u2013746 (2000)","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"24_CR14","unstructured":"PTV: (2008), \n                    \n                      http:\/\/www.ptv.de"},{"key":"24_CR15","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.W.: An incremental algorithm for a generalization of the shortest paths problem. J. Algorithms\u00a021, 267\u2013305 (1996)","journal-title":"J. Algorithms"},{"issue":"1&2","key":"24_CR16","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/0304-3975(95)00079-8","volume":"158","author":"G. Ramalingam","year":"1996","unstructured":"Ramalingam, G., Reps, T.: On the computational complexity of dynamic graph problems. Theoret. Comput. Sci.\u00a0158(1&2), 233\u2013277 (1996)","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"24_CR17","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/s00453-010-9401-5","volume":"61","author":"L. Roditty","year":"2011","unstructured":"Roditty, L., Zwick, U.: On dynamic shortest paths problems. Algorithmica\u00a061(2), 389\u2013401 (2011)","journal-title":"Algorithmica"}],"container-title":["Lecture Notes in Computer Science","Experimental Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-07959-2_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T21:37:17Z","timestamp":1558906637000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-07959-2_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319079585","9783319079592"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07959-2_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}