"A note of an O(n3/logn) time algorithm for all pairs shortest ..."

Yijie Han (2008)

> Home

Details and statistics

DOI: 10.1016/J.IPL.2007.08.015

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/Han08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ipl/Han08
Yijie Han:
A note of an O(n³/logn) time algorithm for all pairs shortest paths. Inf. Process. Lett. 105(3): 114-116 (2008)

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.