Spatio-temporal networks. Modeling and algorithms

DOI10.1007/978-1-4614-4918-8MaRDI QIDQ2907523zbMATH OpenOpenAlexFDO

Authors Betsy George, Sangho Kim

Publication date 10 September 2012

Published in SpringerBriefs in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-1-4614-4918-8

zbMATH Keywords

best start time journeys problemshortest path problemspatio-temporal networks

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Graph theory (including graph drawing) in computer science (68R10) Dynamic programming (90C39)

Recommendations

• Time-varying network optimization.
• scientific article; zbMATH DE number 1488066
• scientific article; zbMATH DE number 4053318
• Solving the \(k\)-shortest path problem with time windows in a time varying network
• Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length

Cited in

(6)

• Spatio-temporal organization of a cellular automaton model for computer network
• \textit{Physarum polycephalum} assignment: a new attempt for fuzzy user equilibrium
• Spatial Analysis along Networks
• MODELING TEMPORAL AND SPATIAL FEATURES OF COLLABORATION NETWORK
• scientific article; zbMATH DE number 5790394 (Why is no real title available?)
• The effect of signaling latencies and node refractory states on the dynamics of networks

This page was built for publication: Spatio-temporal networks. Modeling and algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2907523)