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


The radius and diameter are fundamental graph parameters, with several natural definitions for directed graphs. Each definition is well-motivated in a variety of applications. All versions of diameter and radius can be solved via solving all-pairs shortest paths (APSP), followed by a fast postprocessing step. However, solving APSP on n-node graphs requires… (More)


3 Figures and Tables


Citations per Year

Citation Velocity: 70

Averaging 70 citations per year over the last 2 years.

Learn more about how we calculate this metric in our FAQ.