External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

An All Pairs Shortest Path Algorithm with Expected Running Time O(n^2 log n)

Alistair Moffat, Tadao Takaoka. An All Pairs Shortest Path Algorithm with Expected Running Time O(n^2 log n). In 26th Annual Symposium on Foundations of Computer Science, 21-23 October 1985, Portland, Oregon, USA. pages 101-105, IEEE, 1985.

Abstract

Abstract is missing.

runs on