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