Cluster-Graph Edit Distance: Optimal Explicit Embeddings, Metric Proxies, and Complexity

From MaRDI portal

MaRDI QIDQ7340338arXivFDO

Authors Jiye Liu, Wen-Kai Wang, Qiang Tian, Wenjun Wang

Publication date 2026

Published in arXiv


arXiv classification

cs.DS















This page was built for publication: Cluster-Graph Edit Distance: Optimal Explicit Embeddings, Metric Proxies, and Complexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7340338)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Cluster-Graph_Edit_Distance:_Optimal_Explicit_Embeddings,_Metric_Proxies,_and_Complexity&oldid=107930588"
Powered by MediaWiki