Triangles and Girth in Disk Graphs and Transmission Graphs

by   Haim Kaplan, et al.

Let S ⊂R^2 be a set of n sites, where each s ∈ S has an associated radius r_s > 0. The disk graph D(S) is the undirected graph with vertex set S and an undirected edge between two sites s, t ∈ S if and only if |st| ≤ r_s + r_t, i.e., if the disks with centers s and t and respective radii r_s and r_t intersect. Disk graphs are used to model sensor networks. Similarly, the transmission graph T(S) is the directed graph with vertex set S and a directed edge from a site s to a site t if and only if |st| ≤ r_s, i.e., if t lies in the disk with center s and radius r_s. We provide algorithms for detecting (directed) triangles and, more generally, computing the length of a shortest cycle (the girth) in D(S) and in T(S). These problems are notoriously hard in general, but better solutions exist for special graph classes such as planar graphs. We obtain similarly efficient results for disk graphs and for transmission graphs. More precisely, we show that a shortest (Euclidean) triangle in D(S) and in T(S) can be found in O(n log n) expected time, and that the (weighted) girth of D(S) can be found in O(n log n) expected time. For this, we develop new tools for batched range searching that may be of independent interest.


Tight Hardness for Shortest Cycles and Paths in Sparse Graphs

Fine-grained reductions have established equivalences between many core ...

Minimum Cuts in Geometric Intersection Graphs

Let 𝒟 be a set of n disks in the plane. The disk graph G_𝒟 for 𝒟 is the ...

Insertion-Only Dynamic Connectivity in General Disk Graphs

Let S ⊆ℝ^2 be a set of n sites in the plane, so that every site s ∈ S ha...

Spanners in randomly weighted graphs: independent edge lengths

Given a connected graph G=(V,E) and a length function ℓ:E→ℝ we let d_v,w...

Cheeger Inequalities for Directed Graphs and Hypergraphs Using Reweighted Eigenvalues

We derive Cheeger inequalities for directed graphs and hypergraphs using...

Reachability Problems for Transmission Graphs

Let P be a set of n points in the plane where each point p of P is assoc...

Improved Bounds for the Oriented Radius of Mixed Multigraphs

A mixed multigraph is a multigraph which may contain both undirected and...

Please sign up or login with your details

Forgot password? Click here to reset