Login / Signup

Distance Oracles for Unweighted Graphs: Breaking the Quadratic Barrier with Constant Additive Error.

Surender BaswanaAkshay GaurSandeep SenJayant Upadhyay
Published in: ICALP (1) (2008)
Keyphrases
  • additive error
  • worst case
  • edge weights
  • undirected graph
  • lower bound
  • asymptotically optimal
  • objective function
  • directed graph
  • pairwise
  • distance function
  • weighted graph
  • database systems
  • spanning tree