Efficient estimation of the modified Gromov-Hausdorff distance between unweighted graphs
From MaRDI portal
Publication:6621859
DOI10.1007/s10878-024-01202-1MaRDI QIDQ6621859
Vladyslav Oles, Alexander Panchenko, Nathan Lemons
Publication date: 21 October 2024
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- Some properties of Gromov-Hausdorff distances
- Conformal Wasserstein distances: comparing surfaces in polynomial time
- Gromov-Wasserstein distances and the metric approach to object matching
- Probabilistic asymptotic properties of some combinatorial optimization problems
- Groups of polynomial growth and expanding maps. Appendix by Jacques Tits
- The quadratic assignment problem. Theory and algorithms
- Computational aspects of the Gromov-Hausdorff distance and its application in non-rigid shape matching
- On the geometry of metric measure spaces. I
- On convex relaxation of graph isomorphism
- Statistical mechanics of complex networks
- Computing the Gromov-Hausdorff Distance for Metric Trees
- A Phase Transition for the Diameter of the Configuration Model
- The Gromov-Hausdorff distance: a brief tutorial on some of its quantitative aspects
- Collective dynamics of ‘small-world’ networks
- Machine Learning: ECML 2004
- Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem
- Metric structures for Riemannian and non-Riemannian spaces. Transl. from the French by Sean Michael Bates. With appendices by M. Katz, P. Pansu, and S. Semmes. Edited by J. LaFontaine and P. Pansu
This page was built for publication: Efficient estimation of the modified Gromov-Hausdorff distance between unweighted graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6621859)
