Revisiting Radius, Diameter, and all Eccentricity Computation in Graphs through Certificates

We introduce notions of certificates allowing to bound eccentricities in a graph. In particular , we revisit radius (minimum eccentricity) and diameter (maximum eccentricity) computation and explain the efficiency of practical radius and diameter algorithms by the existence of small certificates for radius and diameter plus few additional properties. We show how such computation is related to covering a graph with certain balls or complementary of balls. We introduce several new algorithmic techniques related to eccentricity computation and propose algorithms for radius, diameter and all eccentricities with theoretical guarantees with respect to certain graph parameters. This is complemented by experimental results on various real-world graphs showing that these parameters appear to be low in practice. We also obtain refined results in the case where the input graph has low doubling dimension, has low hyperbolicity, or is chordal.

[1]  A. O. Houcine.  On hyperbolic groups , 2006 .

[2]  Matthieu Latapy,et al.  Fast computation of empirically tight bounds for the diameter of massive graphs , 2009, JEAL.

[3]  Feodor F. Dragan,et al.  LexBFS-Orderings and Power of Graphs , 1996, WG.

[4]  Walter A. Kosters,et al.  Determining the diameter of small world networks , 2011, CIKM '11.

[5]  Michel Habib,et al.  A tie-break model for graph search , 2015, Discret. Appl. Math..

[7]  Liam Roditty,et al.  Fast approximation algorithms for the diameter and radius of sparse graphs , 2013, STOC '13.

[8]  Fabrizio Grandoni,et al.  Subcubic Equivalences between Graph Centrality Problems, APSP, and Diameter , 2015, SODA.

[9]  C. Jordan.  Sur les assemblages de lignes. , 1869 .

[10]  Victor Chepoi,et al.  Centers of triangulated graphs , 1988 .

[11]  Luca Trevisan,et al.  An Axiomatic and an Average-Case Analysis of Algorithms and Heuristics for Metric Properties of Graphs , 2016, SODA.

[12]  Walter A. Kosters,et al.  Computing the Eccentricity Distribution of Large Graphs , 2013, Algorithms.

[13]  Feodor F. Dragan,et al.  On the power of BFS to determine a graph's diameter , 2003, Networks.

[14]  Roberto Grossi,et al.  On computing the diameter of real-world undirected graphs , 2013, Theor. Comput. Sci..

[15]  Marco Rosa,et al.  Four degrees of separation , 2011, WebSci '12.

[16]  Andrea Marino,et al.  Fast diameter and radius BFS-based computation in (weakly connected) real-world graphs: With an application to the six degrees of separation games , 2015, Theor. Comput. Sci..

[17]  Feodor F. Dragan,et al.  Diameter determination on restricted graph families , 1998, Discret. Appl. Math..

[18]  Michel Habib,et al.  Into the Square - On the Complexity of Quadratic-Time Solvable Problems , 2014, ArXiv.

[19]  David Steurer,et al.  Analytical approach to parallel repetition , 2013, STOC.

[20]  G. Handler.  Minimax Location of a Facility in an Undirected Tree Graph , 1973 .

[21]  Mihai Patrascu,et al.  On the possibility of faster SAT algorithms , 2010, SODA '10.

[22]  Victor Chepoi,et al.  Packing and Covering delta -Hyperbolic Spaces by Balls , 2007, APPROX-RANDOM.

[23]  Joshua R. Wang,et al.  Approximation and Fixed Parameter Subquadratic Algorithms for Radius and Diameter in Sparse Graphs , 2016, SODA.

[24]  F. Harary,et al.  Eccentricity and centrality in networks , 1995 .

[25]  Virginia Vassilevska Williams,et al.  Hardness of Easy Problems: Basing Hardness on Popular Conjectures such as the Strong Exponential Time Hypothesis (Invited Talk) , 2015, IPEC.

[26]  Feodor F. Dragan,et al.  A Linear-Time Algorithm for Finding a Central Vertex of a Chordal Graph , 1994, ESA.