"An adaptation of Eppstein's algorithm dealing with the k shortest - ..."

H. Bricard (2006)

> Home

Details and statistics

DOI: 10.1016/J.ENDM.2006.06.056

access: closed

type: Journal Article

metadata version: 2020-02-20

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/endm/Bricard06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/endm/Bricard06
H. Bricard:
An adaptation of Eppstein's algorithm dealing with the k shortest - loopless and having at most p arcs - paths problem. Electron. Notes Discret. Math. 25: 23-26 (2006)

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.