{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T05:05:34Z","timestamp":1761973534340,"version":"build-2065373602"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642382321"},{"type":"electronic","value":"9783642382338"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38233-8_26","type":"book-chapter","created":{"date-parts":[[2013,5,15]],"date-time":"2013-05-15T12:57:16Z","timestamp":1368622636000},"page":"312-323","source":"Crossref","is-referenced-by-count":6,"title":["A New Dynamic Graph Structure for Large-Scale Transportation Networks"],"prefix":"10.1007","author":[{"given":"Georgia","family":"Mali","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Panagiotis","family":"Michail","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andreas","family":"Paraskevopoulos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christos","family":"Zaroliagis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"26_CR1","volume-title":"Network Flows: Theory, Algorithms and Applications","author":"R.K. Ahuja","year":"1993","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms and Applications. Prentice Hall, Englewood Cliffs (1993)"},{"key":"26_CR2","unstructured":"ARRIVAL Deliverable D3.6. Improved Algorithms for Robust and Online Timetabling and for Timetable Information Updating. ARRIVAL Project (March 2009), http:\/\/arrival.cti.gr\/uploads\/3rd_year\/ARRIVAL-Del-D3.6.pdf"},{"key":"26_CR3","doi-asserted-by":"crossref","unstructured":"Bauer, R., Delling, D.: SHARC: Fast and robust unidirectional routing. ACM Journal of Experimental Algorithmics\u00a014 (2009)","DOI":"10.1145\/1498698.1537599"},{"issue":"2","key":"26_CR4","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1137\/S0097539701389956","volume":"35","author":"M.A. Bender","year":"2005","unstructured":"Bender, M.A., Demaine, E., Farach-Colton, M.: Cache-Oblivious B-Trees. SIAM Journal on Computing\u00a035(2), 341\u2013358 (2005)","journal-title":"SIAM Journal on Computing"},{"key":"26_CR5","unstructured":"Contraction Hierarchies source code, http:\/\/algo2.iti.kit.edu\/routeplanning.php"},{"key":"26_CR6","doi-asserted-by":"crossref","unstructured":"Delling, D., Goldberg, A.V., Nowatzyk, A., Werneck, R.F.: PHAST: Hardware-Accelerated Shortest Path Trees. In: IPDPS 2011. IEEE (2011)","DOI":"10.1109\/IPDPS.2011.89"},{"key":"26_CR7","unstructured":"9th DIMACS Implementation Challenge \u2013 Shortest Paths, http:\/\/www.dis.uniroma1.it\/challenge9\/index.shtml"},{"key":"26_CR8","unstructured":"10th DIMACS Implementation Challenge \u2013 Graph Partitioning and Graph Clustering, http:\/\/www.cc.gatech.edu\/dimacs10\/"},{"key":"26_CR9","doi-asserted-by":"crossref","unstructured":"Frigo, M., Leiserson, C.E., Prokop, H., Ramachandran, S.: Cache-oblivious algorithms. In: Proc.\u00a040th IEEE FOCS 1999, pp. 285\u2013297 (1999)","DOI":"10.1109\/SFFCS.1999.814600"},{"key":"26_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/978-3-540-68552-4_24","volume-title":"Experimental Algorithms","author":"R. Geisberger","year":"2008","unstructured":"Geisberger, R., Sanders, P., Schultes, D., Delling, D.: Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks. In: McGeoch, C.C. (ed.) WEA 2008. LNCS, vol.\u00a05038, pp. 319\u2013333. Springer, Heidelberg (2008)"},{"key":"26_CR11","unstructured":"Goldberg, A.V., Harrelson, C.: Computing the Shortest Path: A * Search Meets Graph Theory. In: Proc.\u00a0SODA, pp. 156\u2013165 (2005)"},{"key":"26_CR12","first-page":"93","volume":"74","author":"A.V. Goldberg","year":"2009","unstructured":"Goldberg, A.V., Kaplan, H., Werneck, R.F.: Reach for A *: Shortest Path Algorithms with Preprocessing. DIMACS\u00a074, 93\u2013139 (2009)","journal-title":"DIMACS"},{"key":"26_CR13","unstructured":"Mali, G., Michail, P., Paraskevopoulos, A., Zaroliagis, C.: A New Dynamic Graph Structure for Large-Scale Transportation Networks, Technical Report eCOMPASS-TR-005, eCOMPASS Project (October 2012), http:\/\/www.ecompass-project.eu\/?q=node\/135"},{"key":"26_CR14","unstructured":"Schultes, D.: Route Planning in Road Networks. PhD Dissertation, University of Karlsruhe (2008)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38233-8_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T10:09:41Z","timestamp":1746007781000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38233-8_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642382321","9783642382338"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38233-8_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}