"Computing k-shortest path lengths in euclidean networks."

Christopher C. Skiscim, Bruce L. Golden (1987)

> Home

Details and statistics

DOI: 10.1002/NET.3230170308

access: closed

type: Journal Article

metadata version: 2017-05-28

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/networks/SkiscimG87
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/networks/SkiscimG87
Christopher C. Skiscim, Bruce L. Golden:
Computing k-shortest path lengths in euclidean networks. Networks 17(3): 341-352 (1987)

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.