TL;DR
This paper reviews various methods for measuring graph similarity, explores their interconnections, and discusses the computational complexity involved in calculating these distances.
Contribution
It provides a comprehensive overview of graph similarity measures, highlighting their relationships and computational challenges.
Findings
Different approaches to graph similarity are interconnected.
Computing graph distances varies in complexity.
The overview clarifies the landscape of graph similarity metrics.
Abstract
We give an overview of different approaches to measuring the similarity of, or the distance between, two graphs, highlighting connections between these approaches. We also discuss the complexity of computing the distances.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph Theory and Algorithms · Semantic Web and Ontologies · Data Mining Algorithms and Applications