DeepAI AI Chat
Log In Sign Up

A linear-time algorithm and analysis of graph Relative Hausdorff distance

by   Sinan G. Aksoy, et al.

Graph similarity metrics serve far-ranging purposes across many domains in data science. As graph datasets grow in size, scientists need comparative tools that capture meaningful differences, yet are lightweight and scalable. Graph Relative Hausdorff (RH) distance is a promising, recently proposed measure for quantifying degree distribution similarity. In spite of recent interest in RH distance, little is known about its properties. Here, we conduct an algorithmic and analytic study of RH distance. In particular, we provide the first linear-time algorithm for computing RH distance, analyze examples of RH distance between families of graphs, and prove several analytic results concerning the range, density, and extremal behavior of RH distance values.


page 1

page 2

page 3

page 4


Relative Hausdorff Distance for Network Analysis

Similarity measures are used extensively in machine learning and data sc...

Eccentricity function in distance-hereditary graphs

A graph G = (V,E) is distance hereditary if every induced path of G is a...

On the computational complexity of the Steiner k-eccentricity

The Steiner k-eccentricity of a vertex v of a graph G is the maximum Ste...

Medians in median graphs in linear time

The median of a graph G is the set of all vertices x of G minimizing the...

An Õ(n^5/4) Time ε-Approximation Algorithm for RMS Matching in a Plane

The 2-Wasserstein distance (or RMS distance) is a useful measure of simi...

Linear time algorithm to check the singularity of block graphs

A block graph is a graph in which every block is a complete graph. Let G...

Algorithmic techniques for finding resistance distances on structured graphs

In this paper we give a survey of methods used to calculate values of re...