Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"A simplified algorithm for the all pairs shortest path problem with O(n ..."

Tadao Takaoka (2013)

> Home

Details and statistics

DOI: 10.1007/S10878-012-9550-3

access: closed

type: Journal Article

metadata version: 2017-05-18

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jco/Takaoka13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jco/Takaoka13
Tadao Takaoka:
A simplified algorithm for the all pairs shortest path problem with O(n 2logn) expected time. J. Comb. Optim. 25(2): 326-337 (2013)

a service of

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.