A Linear-Time Algorithm and Analysis of Graph Relative Hausdorff Distance

DOI10.1137/19M1248224zbMath1499.05585arXiv1903.01682OpenAlexW2979158719MaRDI QIDQ5025764

No author found.

Publication date: 3 February 2022

Published in: SIAM Journal on Mathematics of Data Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1903.01682

zbMATH Keywords

degree distributionnetwork sciencerelative Hausdorff distancegraph similarity measure

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Network design and communication in computer systems (68M10) Deterministic network models in operations research (90B10) Graph algorithms (graph-theoretic aspects) (05C85) Vertex degrees (05C07)

Uses Software

• SNAP
• GitHub
• plfit

Cites Work

• Unnamed Item
• A linear time algorithm for the Hausdorff distance between convex polygons
• Relaxing the uniformity and independence assumptions using the concept of fractal dimension
• Emergence of Scaling in Random Networks
• Authoritative sources in a hyperlinked environment
• A generative graph model for electrical infrastructure networks
• Power-Law Distributions in Empirical Data
• The Structure and Function of Complex Networks
• A Measure of Similarity between Graph Vertices: Applications to Synonym Extraction and Web Searching
• A distance measure between attributed relational graphs for pattern recognition
• A graph distance metric combining maximum common subgraph and minimum common supergraph

This page was built for publication: A Linear-Time Algorithm and Analysis of Graph Relative Hausdorff Distance