Efficient Computation of Time-Dependent Centralities in Air Transportation Networks

DOI10.1007/978-3-642-19094-0_10zbMath1318.90015OpenAlexW1594273396WikidataQ57013177 ScholiaQ57013177MaRDI QIDQ3078386

Alexander Zock, Steffen Rechner, Annabell Berger, Matthias Müller-Hannemann

Publication date: 20 February 2011

Published in: WALCOM: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-19094-0_10

Mathematics Subject Classification ID

Applications of graph theory (05C90) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Transportation, logistics and supply chain management (90B06) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Unnamed Item
• The modeling of global epidemics: stochastic dynamics and predictability
• The shortest route through a network with time-dependent internodal transit times
• A faster algorithm for betweenness centrality*
• Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
• Efficient models for timetable information in public transportation systems
• The worldwide air transportation network: Anomalous centrality, community structure, and cities' global roles
• An Appraisal of Some Shortest-Path Algorithms
• Network Analysis
• Network Analysis
• CENTRALITY ESTIMATION IN LARGE NETWORKS

This page was built for publication: Efficient Computation of Time-Dependent Centralities in Air Transportation Networks