"A faster algorithm for the single source shortest path problem with few ..."

James B. Orlin et al. (2010)

> Home

Details and statistics

DOI: 10.1016/J.JDA.2009.03.001

access: open

type: Journal Article

metadata version: 2024-02-09

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/jda/OrlinMSW10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jda/OrlinMSW10
James B. Orlin, Kamesh Madduri, K. Subramani, Matthew D. Williamson:
A faster algorithm for the single source shortest path problem with few distinct positive lengths. J. Discrete Algorithms 8(2): 189-198 (2010)

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.