"Subcubic Cost Algorithms for the All Pairs Shortest Path Problem."

Tadao Takaoka (1998)

> Home

Details and statistics

DOI: 10.1007/PL00009198

access: closed

type: Journal Article

metadata version: 2017-05-17

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/algorithmica/Takaoka98
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/Takaoka98
Tadao Takaoka:
Subcubic Cost Algorithms for the All Pairs Shortest Path Problem. Algorithmica 20(3): 309-318 (1998)

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.