"An O(n² log log log n) Expected Time Algorithm for the all Shortest ..."

Tadao Takaoka, Alistair Moffat (1980)

> Home

Details and statistics

DOI: 10.1007/BFB0022539

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-19

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/mfcs/TakaokaM80
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/mfcs/TakaokaM80
Tadao Takaoka, Alistair Moffat:
An O(n² log log log n) Expected Time Algorithm for the all Shortest Distance Problem. MFCS 1980: 643-655

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.