Login / Signup

An O(n² log log log n) Expected Time Algorithm for the all Shortest Distance Problem.

Tadao TakaokaAlistair Moffat
Published in: MFCS (1980)
Keyphrases
  • log log
  • shortest distance
  • np hard
  • worst case
  • learning algorithm
  • optimal solution
  • positive integer
  • similarity measure
  • objective function
  • matching algorithm
  • dynamic programming
  • graphical models