"All shortest distances in a graph. An improvement to Dantzig's inductive ..."

Yves Tabourier (1973)

> Home

Details and statistics

DOI: 10.1016/0012-365X(73)90118-0

access: open

type: Journal Article

metadata version: 2025-01-19

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/dm/Tabourier73
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dm/Tabourier73
Yves Tabourier:
All shortest distances in a graph. An improvement to Dantzig's inductive algorithm. Discret. Math. 4(1): 83-87 (1973)

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.