"Proof of a modified Dijkstra's algorithm for computing shortest bundle ..."

Daniel C. Lee (2006)

> Home

Details and statistics

DOI: 10.1109/LCOMM.2006.051982

access: closed

type: Journal Article

metadata version: 2020-08-20

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/icl/Lee06b
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/icl/Lee06b
Daniel C. Lee:
Proof of a modified Dijkstra's algorithm for computing shortest bundle delay in networks with deterministically time-varying links. IEEE Commun. Lett. 10(10): 734-736 (2006)

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.