An All Pairs Shortest Path Algorithm with Expected Time O(n² log n) - researchr publication bibtex

researchr

You are not signed in
Sign in
Sign up

Alistair Moffat, Tadao Takaoka. An All Pairs Shortest Path Algorithm with Expected Time O(n² log n). SIAM Journal on Computing, 16(6):1023-1031, 1987.

@article{MoffatT87,
  title = {An All Pairs Shortest Path Algorithm with Expected Time O(n&#178; log n)},
  author = {Alistair Moffat and Tadao Takaoka},
  year = {1987},
  researchr = {https://researchr.org/publication/MoffatT87},
  cites = {0},
  citedby = {0},
  journal = {SIAM Journal on Computing},
  volume = {16},
  number = {6},
  pages = {1023-1031},
}

runs on WebDSL