"A Quadratic Algorithm for Finding Next-to-Shortest Paths in Graphs."

Kuo-Hua Kao et al. (2011)

> Home

Details and statistics

DOI: 10.1007/S00453-010-9402-4

access: closed

type: Journal Article

metadata version: 2022-10-02

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/algorithmica/KaoCWJ11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/KaoCWJ11
Kuo-Hua Kao, Jou-Ming Chang, Yue-Li Wang, Justie Su-tzu Juan:
A Quadratic Algorithm for Finding Next-to-Shortest Paths in Graphs. Algorithmica 61(2): 402-418 (2011)

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.