"A Branch-Checking Algorithm for All-Pairs Shortest Paths."

Cees Duin (2005)

> Home

Details and statistics

DOI: 10.1007/S00453-004-1122-1

access: closed

type: Journal Article

metadata version: 2017-06-13

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/algorithmica/Duin04
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/Duin04
Cees Duin:
A Branch-Checking Algorithm for All-Pairs Shortest Paths. Algorithmica 41(2): 131-145 (2005)

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.