"Shortest paths for routing information over temporally dynamic ..."

Michael J. Hirsch, Azar Sadeghnejad, Héctor J. Ortiz-Peña (2017)

> Home

Details and statistics

DOI: 10.1109/MILCOM.2017.8170722

access: closed

type: Conference or Workshop Paper

metadata version: 2019-10-19

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/milcom/HirschSO17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/milcom/HirschSO17
Michael J. Hirsch, Azar Sadeghnejad, Héctor J. Ortiz-Peña:
Shortest paths for routing information over temporally dynamic communication networks. MILCOM 2017: 587-591

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.