Sketching Distances in Monotone Graph Classes.

Louis Esperet Nathaniel Harms Andrey Kupavskii

Published in: APPROX/RANDOM (2022)

Keyphrases

distance function
graph model
distance measure
weighted graph
graph structure
graph theory
graph theoretic
bipartite graph
random walk
graph mining
euclidean distance
graph matching
upper bound
connected components
complex networks
probability measure
sketch recognition
bounded degree