arXiv (All)
open access
Graph Distortion Distances, Gromov-Hausdorff and the Hardness of Gromov-Wasserstein
We study the computational complexity of graph distortion distances, a family of graph metrics measuring how vertex distances differ between two graphs. Formally, these distances are defined in terms of standard matrix norms on the difference of distance matrices under an optimal vertex alignment. T
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- On (Directed) Width-Parameters of Geometric Spanners#1036492
- Curvature-Distortion Numbers of Graphs: Nonnegative Lin--Lu--Yau Curvature#1110358
- Stable and Online Algorithms for Random Matrix Discrepancy#1156862
- Anisotropic View Distance Metric for High-Dimensional Data: Theory, Geometry, and Fast Computation#925690
- Matrix Graphical Model Via Joint Estimation of Partial Correlations#1014306
Record · ID 1341808
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive