Fast approximation algorithms for the diameter and radius of sparse graphs

@inproceedings{Roditty2013FastAA,
  title={Fast approximation algorithms for the diameter and radius of sparse graphs},
  author={Liam Roditty and Virginia Vassilevska Williams},
  booktitle={STOC},
  year={2013}
}
The diameter and the radius of a graph are fundamental topological parameters that have many important practical applications in real world networks. The fastest combinatorial algorithm for both parameters works by solving the all-pairs shortest paths problem (APSP) and has a running time of ~O(mn) in m-edge, n-node graphs. In a seminal paper, Aingworth, Chekuri, Indyk and Motwani [SODA'96 and SICOMP'99] presented an algorithm that computes in ~O(m√ n + n2) time an estimate D for the diameter D… CONTINUE READING
Highly Influential
This paper has highly influenced 13 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 157 citations. REVIEW CITATIONS

Citations

Publications citing this paper.

158 Citations

02040'12'14'16'18
Citations per Year
Semantic Scholar estimates that this publication has 158 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-8 of 8 references

Similar Papers

Loading similar papers…