"An O(n3log⁡log⁡n/log2⁡n) time ..."

Yijie Han, Tadao Takaoka (2016)

> Home

Details and statistics

DOI: 10.1016/J.JDA.2016.09.001

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/HanT16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jda/HanT16
Yijie Han, Tadao Takaoka:
An O(n³log⁡log⁡n/log²⁡n) time algorithm for all pairs shortest paths. J. Discrete Algorithms 38-41: 9-19 (2016)

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.