"Computing k shortest paths from a source node to each other node."

Guisong Liu et al. (2015)

> Home

Details and statistics

DOI: 10.1007/S00500-014-1434-2

access: closed

type: Journal Article

metadata version: 2020-12-29

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/soco/LiuQQJT15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/soco/LiuQQJT15
Guisong Liu, Zhao Qiu, Hong Qu, Luping Ji, Alexander Takacs:
Computing k shortest paths from a source node to each other node. Soft Comput. 19(8): 2391-2402 (2015)

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.