57 research outputs found
Multivariate Analysis of Orthogonal Range Searching and Graph Distances Parameterized by Treewidth
We show that the eccentricities, diameter, radius, and Wiener index of an
undirected -vertex graph with nonnegative edge lengths can be computed in
time , where
is the treewidth of the graph. For every , this bound is
, which matches a hardness result of Abboud,
Vassilevska Williams, and Wang (SODA 2015) and closes an open problem in the
multivariate analysis of polynomial-time computation. To this end, we show that
the analysis of an algorithm of Cabello and Knauer (Comp. Geom., 2009) in the
regime of non-constant treewidth can be improved by revisiting the analysis of
orthogonal range searching, improving bounds of the form to
, as originally observed by Monier (J. Alg.
1980).
We also investigate the parameterization by vertex cover number
Multivariate Analysis of Orthogonal Range Searching and Graph Distances
We show that the eccentricities, diameter, radius, and Wiener index of an undirected n-vertex graph with nonnegative edge lengths can be computed in time O(n * binom{k+ceil[log n]}{k} * 2^k k^2 log n), where k is the treewidth of the graph. For every epsilon>0, this bound is n^{1+epsilon}exp O(k), which matches a hardness result of Abboud, Vassilevska Williams, and Wang (SODA 2015) and closes an open problem in the multivariate analysis of polynomial-time computation. To this end, we show that the analysis of an algorithm of Cabello and Knauer (Comp. Geom., 2009) in the regime of non-constant treewidth can be improved by revisiting the analysis of orthogonal range searching, improving bounds of the form log^d n to binom{d+ceil[log n]}{d}, as originally observed by Monier (J. Alg. 1980).
We also investigate the parameterization by vertex cover number
Minimizing and Computing the Inverse Geodesic Length on Trees
For any fixed measure H that maps graphs to real numbers, the MinH problem is defined as follows: given a graph G, an integer k, and a target tau, is there a set S of k vertices that can be deleted, so that H(G - S) is at most tau? In this paper, we consider the MinH problem on trees.
We call H balanced on trees if, whenever G is a tree, there is an optimal choice of S such that the components of G - S have sizes bounded by a polynomial in n / k. We show that MinH on trees is Fixed-Parameter Tractable (FPT) for parameter n / k, and furthermore, can be solved in subexponential time, and polynomial space, whenever H is additive, balanced on trees, and computable in polynomial time.
A particular measure of interest is the Inverse Geodesic Length (IGL), which is used to gauge the efficiency and connectedness of a graph. It is defined as the sum of inverse distances between every two vertices: IGL(G) = sum_{{u,v} subseteq V} 1/d_G(u,v). While MinIGL is W[1]-hard for parameter treewidth, and cannot be solved in 2^{o(k + n + m)} time, even on bipartite graphs with n vertices and m edges, the complexity status of the problem remains open in the case where G is a tree. We show that IGL is balanced on trees, to give a 2^O((n log n)^(5/6)) time, polynomial space algorithm.
The distance distribution of G is the sequence {a_i} describing the number of vertex pairs distance i apart in G: a_i = |{{u, v}: d_G(u, v) = i}|. Given only the distance distribution, one can easily determine graph parameters such as diameter, Wiener index, and particularly, the IGL. We show that the distance distribution of a tree can be computed in O(n log^2 n) time by reduction to polynomial multiplication. We also extend the result to graphs with small treewidth by showing that the first p values of the distance distribution can be computed in 2^(O(tw(G))) n^(1 + epsilon) sqrt(p) time, and the entire distance distribution can be computed in 2^(O(tw(G))) n^{1 + epsilon} time, when the diameter of G is O(n^epsilon\u27) for every epsilon\u27 > 0
Balancing graph Voronoi diagrams with one more vertex
Let be a graph with unit-length edges and nonnegative costs
assigned to its vertices. Being given a list of pairwise different vertices
, the {\em prioritized Voronoi diagram} of with
respect to is the partition of in subsets so
that, for every with , a vertex is in if and
only if is a closest vertex to in and there is no closest vertex
to in within the subset . For every
with , the {\em load} of vertex equals the sum of the
costs of all vertices in . The load of equals the maximum load of a
vertex in . We study the problem of adding one more vertex at the end of
in order to minimize the load. This problem occurs in the context of
optimally locating a new service facility ({\it e.g.}, a school or a hospital)
while taking into account already existing facilities, and with the goal of
minimizing the maximum congestion at a site. There is a brute-force algorithm
for solving this problem in time on -vertex -edge graphs.
We prove a matching time lower bound for the special case where
and , assuming the so called Hitting Set Conjecture of Abboud et al. On
the positive side, we present simple linear-time algorithms for this problem on
cliques, paths and cycles, and almost linear-time algorithms for trees, proper
interval graphs and (assuming to be a constant) bounded-treewidth graphs
Diameter computation on H-minor free graphs and graphs of bounded (distance) VC-dimension
International audienceUnder 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 Õ(k · mn 1−ε_d), where ε_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 ε-nets, region decomposition and other partition techniques
LIPIcs, Volume 248, ISAAC 2022, Complete Volume
LIPIcs, Volume 248, ISAAC 2022, Complete Volum
- …