{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T23:14:49Z","timestamp":1725578089865},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642190933"},{"type":"electronic","value":"9783642190940"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-19094-0_10","type":"book-chapter","created":{"date-parts":[[2011,2,10]],"date-time":"2011-02-10T06:21:40Z","timestamp":1297318900000},"page":"77-88","source":"Crossref","is-referenced-by-count":1,"title":["Efficient Computation of Time-Dependent Centralities in Air Transportation Networks"],"prefix":"10.1007","author":[{"given":"Annabell","family":"Berger","sequence":"first","affiliation":[]},{"given":"Matthias","family":"M\u00fcller-Hannemann","sequence":"additional","affiliation":[]},{"given":"Steffen","family":"Rechner","sequence":"additional","affiliation":[]},{"given":"Alexander","family":"Zock","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"10_CR1","doi-asserted-by":"publisher","first-page":"21484","DOI":"10.1073\/pnas.0906910106","volume":"106","author":"D. Balcan","year":"2009","unstructured":"Balcan, D., Colizza, V., Gon\u00e7alves, B., Hu, H., Ramasco, J., Verspignani, A.: Multiscale mobility networks and the spatial spreading of infectious diseases. PNAS\u00a0106, 21484\u201321489 (2009)","journal-title":"PNAS"},{"key":"10_CR2","doi-asserted-by":"publisher","first-page":"2015","DOI":"10.1073\/pnas.0510525103","volume":"103","author":"V. Colizza","year":"2006","unstructured":"Colizza, V., Barth\u00e9lemy, A.B.M., Vespignani, A.: The role of the airline transportation network in the prediction and predictability of global epidemics. PNAS\u00a0103, 2015\u20132020 (2006)","journal-title":"PNAS"},{"key":"10_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/978-3-540-31955-9_3","volume-title":"Network Analysis","author":"D. Kosch\u00fctzki","year":"2005","unstructured":"Kosch\u00fctzki, D., Lehmann, K.A., Peeters, L., Richter, S., Tenfelde-Podehl, D., Zlotowski, O.: Centrality indices. In: Brandes, U., Erlebach, T. (eds.) Network Analysis. LNCS, vol.\u00a03418, pp. 16\u201361. Springer, Heidelberg (2005)"},{"key":"10_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/978-3-540-31955-9_4","volume-title":"Network Analysis","author":"R. Jacob","year":"2005","unstructured":"Jacob, R., Kosch\u00fctzki, D., Lehmann, K.A., Peeters, L., Tenfelde-Podehl, D.: Algorithms for centrality indices. In: Brandes, U., Erlebach, T. (eds.) Network Analysis. LNCS, vol.\u00a03418, pp. 62\u201382. Springer, Heidelberg (2005)"},{"key":"10_CR5","doi-asserted-by":"publisher","first-page":"466","DOI":"10.1016\/j.socnet.2005.11.005","volume":"28","author":"S. Borgatti","year":"2006","unstructured":"Borgatti, S., Everett, M.: A graph-theoretic perspective on centrality. Social Networks\u00a028, 466\u2013484 (2006)","journal-title":"Social Networks"},{"key":"10_CR6","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1080\/0022250X.2001.9990249","volume":"25","author":"U. Brandes","year":"2001","unstructured":"Brandes, U.: A faster algorithm for betweenness centrality. Journal of Mathematical Sociology\u00a025, 163\u2013177 (2001)","journal-title":"Journal of Mathematical Sociology"},{"key":"10_CR7","doi-asserted-by":"publisher","first-page":"2303","DOI":"10.1142\/S0218127407018403","volume":"17","author":"U. Brandes","year":"2007","unstructured":"Brandes, U., Pich, C.: Centrality estimation in large networks. I. J. Bifurcation and Chaos\u00a017, 2303\u20132318 (2007)","journal-title":"I. J. Bifurcation and Chaos"},{"key":"10_CR8","first-page":"90","volume-title":"ALENEX","author":"R. Geisberger","year":"2008","unstructured":"Geisberger, R., Sanders, P., Schultes, D.: Better approximation of betweenness centrality. In: Munro, J.I., Wagner, D. (eds.) ALENEX, pp. 90\u2013100. SIAM, Philadelphia (2008)"},{"key":"10_CR9","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1140\/epjb\/e2004-00131-0","volume":"38","author":"R. Guimer\u00e0","year":"2004","unstructured":"Guimer\u00e0, R., Amaral, L.: Modeling the world-wide airport network. European Physical Journal B\u00a038, 381\u2013385 (2004)","journal-title":"European Physical Journal B"},{"key":"10_CR10","doi-asserted-by":"publisher","first-page":"7794","DOI":"10.1073\/pnas.0407994102","volume":"102","author":"R. Guimer\u00e0","year":"2005","unstructured":"Guimer\u00e0, R., Mossa, S., Turtschi, A., Amaral, L.: The worldwide air transportation network: Anomalous centrality, community structure, and cities\u2019 global roles. PNAS\u00a0102, 7794\u20137799 (2005)","journal-title":"PNAS"},{"key":"10_CR11","unstructured":"Burghouwt, G., Redondi, R.: Connectivity in air transport networks: models, measures and applications. Technical Report 1\/09, Department of Economics and technology Management, University of Bergamo (2009)"},{"key":"10_CR12","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/j.jairtraman.2007.10.003","volume":"14","author":"P. Malighetti","year":"2008","unstructured":"Malighetti, P., Paleari, S., Redondi, R.: Connectivity of the European airport network: \u201cself-help hubbing\u201d and business implications. Journal of Air Transport Management\u00a014, 53\u201365 (2008)","journal-title":"Journal of Air Transport Management"},{"key":"10_CR13","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1016\/j.tre.2009.08.003","volume":"46","author":"S. Paleari","year":"2010","unstructured":"Paleari, S., Redondi, R., Malighetti, P.: A comparative study of airport connectivity in China, Europe and US: Which network provides the best service to passengers? Transportation Research Part E: Logistics and Transportation Review\u00a046, 198\u2013210 (2010)","journal-title":"Transportation Research Part E: Logistics and Transportation Review"},{"key":"10_CR14","unstructured":"Berger, A., M\u00fcller-Hannemann, M.: Subpath-optimality of multi-criteria shortest paths in time-dependent and event-dependent networks. Technical report 2009\/1, Martin-Luther-Universit\u00e4t Halle-Wittenberg, Institute of Computer Science (2009)"},{"key":"10_CR15","series-title":"Electronic Notes in Theoretical Computer Science","volume-title":"Proceedings of the 3rd Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS 2003)","author":"G.S. Brodal","year":"2004","unstructured":"Brodal, G.S., Jacob, R.: Time-dependent networks as models to achieve fast exact time-table queries. In: Proceedings of the 3rd Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS 2003). Electronic Notes in Theoretical Computer Science, vol.\u00a092. Elsevier, Amsterdam (2004)"},{"key":"10_CR16","doi-asserted-by":"crossref","unstructured":"Pyrga, E., Schulz, F., Wagner, D., Zaroliagis, C.: Efficient models for timetable information in public transportation systems. ACM Journal of Experimental Algorithmics\u00a012 (2007); Article 2.4","DOI":"10.1145\/1227161.1227166"},{"key":"10_CR17","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1016\/0022-247X(66)90009-6","volume":"14","author":"K. Cook","year":"1966","unstructured":"Cook, K., Hasley, E.: The shortest route through a network with time-dependent internodal transit times. Journal of Mathematical Analysis and Applications\u00a014, 493\u2013498 (1966)","journal-title":"Journal of Mathematical Analysis and Applications"},{"key":"10_CR18","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1287\/opre.17.3.395","volume":"17","author":"S. Dreyfus","year":"1969","unstructured":"Dreyfus, S.: An appraisal of some shortest-path algorithms. Operations Research\u00a017, 395\u2013412 (1969)","journal-title":"Operations Research"},{"key":"10_CR19","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1145\/79147.214078","volume":"37","author":"A. Orda","year":"1990","unstructured":"Orda, A., Rom, R.: Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length. J. ACM\u00a037, 607\u2013625 (1990)","journal-title":"J. ACM"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-19094-0_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,8]],"date-time":"2019-06-08T12:47:58Z","timestamp":1559998078000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-19094-0_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642190933","9783642190940"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-19094-0_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}