n³loglogn/logn) time algorithm for the all-pairs shortest path problem.">n³loglogn/logn) time algorithm for the all-pairs shortest path problem., dblp, computer science, bibliography, knowledge graph, author, editor, publication, conference, journal, book, thesis, database, collection, open data, bibtex">

default search action

combined dblp search
author search
venue search
publication search

ask others

"An O(n3loglogn/logn) time algorithm for ..."

Tadao Takaoka (2005)

> Home

Details and statistics

DOI: 10.1016/J.IPL.2005.08.008

access: closed

type: Journal Article

metadata version: 2017-05-26

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ipl/Takaoka05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ipl/Takaoka05
Tadao Takaoka:
An O(n³loglogn/logn) time algorithm for the all-pairs shortest path problem. Inf. Process. Lett. 96(5): 155-161 (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.