"An improved Dijkstra's shortest path algorithm for sparse network."

M. H. Xu et al. (2007)

> Home

Details and statistics

DOI: 10.1016/J.AMC.2006.06.094

access: closed

type: Journal Article

metadata version: 2020-02-21

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/amc/XuLHZL07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/amc/XuLHZL07
M. H. Xu, Y. Q. Liu, Q. L. Huang, Y. X. Zhang, G. F. Luan:
An improved Dijkstra's shortest path algorithm for sparse network. Appl. Math. Comput. 185(1): 247-254 (2007)

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.