Login / Signup

Approximation and Fixed Parameter Subquadratic Algorithms for Radius and Diameter in Sparse Graphs.

Amir AbboudVirginia Vassilevska WilliamsJoshua R. Wang
Published in: SODA (2016)
Keyphrases
  • graph theory
  • error bounds
  • learning algorithm
  • computational complexity
  • computational cost
  • data structure
  • sparse representation
  • data mining
  • significant improvement
  • worst case
  • representational power