Diameter computation on H-minor free graphs and graphs of bounded (distance) VC-dimension

Under the Strong Exponential-Time Hypothesis, the diameter of general unweighted graphs cannot be computed in truly subquadratic time. Nevertheless there are several graph classes for which this can be done such as bounded-treewidth graphs, interval graphs and planar graphs, to name a few. We propose to study unweighted graphs of constant distance VC-dimension as a broad generalization of many such classes-where the distance VC-dimension of a graph G is defined as the VC-dimension of its ball hypergraph: whose hyperedges are the balls of all possible radii and centers in G. In particular for any fixed H, the class of H-minor free graphs has distance VC-dimension at most |V (H)| − 1. • Our first main result is a Monte Carlo algorithm that on graphs of distance VC-dimension at most d, for any fixed k, either computes the diameter or concludes that it is larger than k in time O(k · mn 1−e_d), where e_d ∈ (0; 1) only depends on d. We thus obtain a truly subquadratic-time parameterized algorithm for computing the diameter on such graphs. • Then as a byproduct of our approach, we get the first truly subquadratic-time randomized algorithm for constant diameter computation on all the nowhere dense graph classes. The latter classes include all proper minor-closed graph classes, bounded-degree graphs and graphs of bounded expansion. • Finally, we show how to remove the dependency on k for any graph class that excludes a fixed graph H as a minor. More generally, our techniques apply to any graph with constant distance VC-dimension and polynomial expansion (or equivalently having strongly sublin-ear balanced separators). As a result for all such graphs one obtains a truly subquadratic-time randomized algorithm for computing their diameter. We note that all our results also hold for radius computation. Our approach is based on the work of Chazelle and Welzl who proved the existence of spanning paths with strongly sublinear stabbing number for every hypergraph of constant VC-dimension. We show how to compute such paths efficiently by combining known algorithms for the stabbing number problem with a clever use of e-nets, region decomposition and other partition techniques.

[1]  A. Bonato,et al.  Graphs and Hypergraphs , 2022 .

[2]  M. Habib,et al.  Fast Diameter Computation within Split Graphs , 2019, COCOA.

[3]  Merav Parter,et al.  Planar diameter via metric compression , 2019, STOC.

[4]  Guillaume Ducoffe,et al.  A New Application of Orthogonal Range Searching for Computing Giant Graph Diameters , 2018, SOSA.

[5]  Yin Tat Lee,et al.  Solving linear programs in the current matrix multiplication time , 2018, STOC.

[6]  Liam Roditty,et al.  Towards tight approximation bounds for graph diameter and eccentricities , 2018, STOC.

[7]  T. Husfeldt,et al.  Multivariate Analysis of Orthogonal Range Searching and Graph Distances Parameterized by Treewidth , 2018, arXiv.org.

[8]  Zdenvek Dvovr'ak,et al.  On classes of graphs with strongly sublinear separators , 2017, Eur. J. Comb..

[9]  David Coudert,et al.  Fully Polynomial FPT Algorithms for Some Classes of Bounded Clique-width Graphs , 2017, SODA.

[10]  Haim Kaplan,et al.  Voronoi Diagrams on Planar Graphs, and Computing the Diameter in Deterministic Õ(n5/3) Time , 2017, SODA.

[11]  Sergio Cabello,et al.  Subquadratic Algorithms for the Diameter and the Sum of Pairwise Distances in Planar Graphs , 2017, SODA.

[12]  Jacob Evald,et al.  Tight Hardness Results for Distance and Centrality Problems in Constant Degree Graphs , 2016, ArXiv.

[13]  Peter Damaschke,et al.  Computing Giant Graph Diameters , 2016, IWOCA.

[14]  Michel Habib,et al.  Into the Square: On the Complexity of Some Quadratic-time Solvable Problems , 2016, ICTCS.

[15]  Søren Dahlgaard,et al.  On the Hardness of Partially Dynamic Graph Problems and Connections to Diameter , 2016, ICALP.

[16]  Roberto Grossi,et al.  New Bounds for Approximating Extremal Distances in Undirected Graphs , 2016, SODA.

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

[18]  Zdenek Dvorak,et al.  Strongly Sublinear Separators and Polynomial Expansion , 2015, SIAM J. Discret. Math..

[19]  Kent Quanrud,et al.  Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs , 2015, ESA.

[20]  Nicolas Bousquet,et al.  VC-dimension and Erdős-Pósa property , 2014, Discret. Math..

[21]  Zdenek Dvorak,et al.  Treewidth of graphs with balanced separations , 2014, J. Comb. Theory, Ser. B.

[22]  Aline Parreau,et al.  Identifying Codes in Hereditary Classes of Graphs and VC-Dimension , 2014, SIAM J. Discret. Math..

[23]  Robert E. Tarjan,et al.  Better Approximation Algorithms for the Graph Diameter , 2014, SODA.

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

[25]  Jaroslav Nesetril,et al.  Sparsity - Graphs, Structures, and Algorithms , 2012, Algorithms and combinatorics.

[26]  Christian Wulff-Nilsen,et al.  Separator Theorems for Minor-Free and Shallow Minor-Free Graphs with Applications , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.

[27]  Ken-ichi Kawarabayashi,et al.  Linear-Space Approximate Distance Oracles for Planar, Bounded-Genus and Minor-Free Graphs , 2011, ICALP.

[28]  Bruce A. Reed,et al.  A Separator Theorem in Minor-Closed Classes , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.

[29]  Timothy M. Chan Optimal Partition Trees , 2010, SCG.

[30]  Sariel Har-Peled,et al.  Approximating Spanning Trees with Low Crossing Number , 2009, ArXiv.

[31]  David Eisenstat,et al.  The VC dimension of k-fold union , 2007, Inf. Process. Lett..

[32]  Victor Chepoi,et al.  Covering Planar Graphs with a Fixed Number of Balls , 2007, Discret. Comput. Geom..

[33]  Mohit Singh,et al.  On the Crossing Spanning Tree Problem , 2004, APPROX-RANDOM.

[34]  Jirí Matousek,et al.  Bounded VC-Dimension Implies a Fractional Helly Theorem , 2004, Discret. Comput. Geom..

[35]  David Eppstein,et al.  Dynamic generators of topologically embedded graphs , 2002, SODA '03.

[36]  Jon M. Kleinberg,et al.  Detecting a network failure , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[37]  Laurent Viennot,et al.  Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing , 2000, Theor. Comput. Sci..

[38]  D. Eppstein Diameter and Treewidth in Minor-Closed Graph Families , 1999, Algorithmica.

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

[40]  Gerhard J. Woeginger,et al.  The VC-dimension of Set Systems Defined by Graphs , 1997, Discret. Appl. Math..

[41]  Colin Cooper,et al.  The vapnik-chervonenkis dimension of a random graph , 1995, Discret. Math..

[42]  Philip N. Klein,et al.  Faster Shortest-Path Algorithms for Planar Graphs , 1997, J. Comput. Syst. Sci..

[43]  Satish Rao,et al.  Shallow excluded minors and improved graph decompositions , 1994, SODA '94.

[44]  Bernard Chazelle,et al.  Product range spaces, sensitive sampling, and derandomization , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[45]  Michael R. Fellows,et al.  Parameterized learning complexity , 1993, COLT '93.

[46]  Feodor F. Dragan,et al.  Dually Chordal Graphs , 1993, SIAM J. Discret. Math..

[47]  Mihalis Yannakakis,et al.  On limited nondeterminism and the complexity of the V-C dimension , 1993, [1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference.

[48]  Bernard Chazelle,et al.  Quasi-optimal range searching in spaces of finite VC-dimension , 1989, Discret. Comput. Geom..

[49]  David Haussler,et al.  ɛ-nets and simplex range queries , 1987, Discret. Comput. Geom..

[50]  Greg N. Frederickson,et al.  Fast Algorithms for Shortest Paths in Planar Graphs, with Applications , 1987, SIAM J. Comput..

[51]  Arthur M. Farley,et al.  Computation of the center and diameter of outerplanar graphs , 1980, Discret. Appl. Math..

[52]  R. Tarjan,et al.  A Separator Theorem for Planar Graphs , 1977 .

[53]  Norbert Sauer,et al.  On the Density of Families of Sets , 1972, J. Comb. Theory A.

[54]  S. Shelah A combinatorial problem; stability and order for models and theories in infinitary languages. , 1972 .

[55]  J. Nesetril,et al.  Structural sparsity , 2016 .

[56]  Elsev Iek The algorithmic use of hypertree structure and maximum neighbourhood orderings , 2003 .

[57]  Emo Welzl,et al.  On Spanning Trees with Low Crossing Numbers , 1992, Data Structures and Efficient Algorithms.

[58]  Jirí Matousek,et al.  Spanning trees with low crossing number , 1991, RAIRO Theor. Informatics Appl..

[59]  N. Alon,et al.  A separator theorem for nonplanar graphs , 1990 .

[60]  Stephan Olariu,et al.  A simple linear-time algorithm for computing the center of an interval graph , 1990, Int. J. Comput. Math..

[61]  Vladimir Vapnik,et al.  Chervonenkis: On the uniform convergence of relative frequencies of events to their probabilities , 1971 .

[62]  Frank Harary,et al.  Graph Theory , 2016 .