"Algorithms for shortest paths and d-cycle problems."

Sergei Bespamyatnikh, Andrei V. Kelarev (2003)

> Home

Details and statistics

DOI: 10.1016/S1570-8667(03)00002-9

access: open

type: Journal Article

metadata version: 2021-02-16

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/jda/BespamyatnikhK03
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jda/BespamyatnikhK03
Sergei Bespamyatnikh, Andrei V. Kelarev:
Algorithms for shortest paths and d-cycle problems. J. Discrete Algorithms 1(1): 1-9 (2003)

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.