Enumeration of Far-Apart Pairs by Decreasing Distance for Faster Hyperbolicity Computation

04/26/2021
by   David Coudert, et al.
0

Hyperbolicity is a graph parameter which indicates how much the shortest-path distance metric of a graph deviates from a tree metric. It is used in various fields such as networking, security, and bioinformatics for the classification of complex networks, the design of routing schemes, and the analysis of graph algorithms. Despite recent progress, computing the hyperbolicity of a graph remains challenging. Indeed, the best known algorithm has time complexity O(n^3.69), which is prohibitive for large graphs, and the most efficient algorithms in practice have space complexity O(n^2). Thus, time as well as space are bottlenecks for computing hyperbolicity. In this paper, we design a tool for enumerating all far-apart pairs of a graph by decreasing distances. A node pair (u, v) of a graph is far-apart if both v is a leaf of all shortest-path trees rooted at u and u is a leaf of all shortest-path trees rooted at v. This notion was previously used to drastically reduce the computation time for hyperbolicity in practice. However, it required the computation of the distance matrix to sort all pairs of nodes by decreasing distance, which requires an infeasible amount of memory already for medium-sized graphs. We present a new data structure that avoids this memory bottleneck in practice and for the first time enables computing the hyperbolicity of several large graphs that were far out-of-reach using previous algorithms. For some instances, we reduce the memory consumption by at least two orders of magnitude. Furthermore, we show that for many graphs, only a very small fraction of far-apart pairs have to be considered for the hyperbolicity computation, explaining this drastic reduction of memory. As iterating over far-apart pairs in decreasing order without storing them explicitly is a very general tool, we believe that our approach might also be relevant to other problems.

READ FULL TEXT
research
08/19/2019

A New Fast Unweighted All-pairs Shortest Path Search Algorithm Based on Pruning by Shortest Path Trees

We present a new fast all-pairs shortest path algorithm for unweighted g...
research
12/07/2012

Developments in the theory of randomized shortest paths with a comparison of graph node distances

There have lately been several suggestions for parametrized distances on...
research
09/28/2017

A New Balanced Subdivision of a Simple Polygon for Time-Space Trade-off Algorithms

We are given a read-only memory for input and a write-only stream for ou...
research
05/09/2022

Visualizing WSPDs and their applications

Introduced by Callahan and Kosaraju back in 1995, the concept of well-se...
research
11/14/2021

A Simple Algorithm for Multiple-Source Shortest Paths in Planar Digraphs

Given an n-vertex planar embedded digraph G with non-negative edge weigh...
research
04/23/2020

Engineering Data Reduction for Nested Dissection

Many applications rely on time-intensive matrix operations, such as fact...
research
11/16/2021

Hyperbolicity Computation through Dominating Sets

Hyperbolicity is a graph parameter related to how much a graph resembles...

Please sign up or login with your details

Forgot password? Click here to reset