Login / Signup
Shortest paths for routing information over temporally dynamic communication networks.
Michael J. Hirsch
Azar Sadeghnejad
Héctor J. Ortiz-Peña
Published in:
MILCOM (2017)
Keyphrases
</>
shortest path
communication networks
information flow
temporal information
decision making
knowledge management
road network
routing algorithm
weighted graph
network design
shortest path problem
path length
shortest path algorithm