Login / Signup

Fully Dynamic All-Pairs Shortest Paths: Breaking the O(n) Barrier.

Ittai AbrahamShiri ChechikKunal Talwar
Published in: APPROX-RANDOM (2014)
Keyphrases
  • spatio temporal
  • dynamic environments
  • high quality
  • cooperative
  • pattern recognition
  • data analysis
  • lower bound
  • pairwise
  • probabilistic model