Approximate Graph Isomorphism

DOI10.1007/978-3-642-32589-2_12zbMath1365.68464OpenAlexW48399392MaRDI QIDQ2912712

V. Arvind, Sebastian Kuhnert, Yadu Vasudev, Johannes Köbler

Publication date: 25 September 2012

Published in: Mathematical Foundations of Computer Science 2012 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-32589-2_12

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (6)

Detecting almost symmetries of graphs ⋮ Isomorphic Distances Among Elections ⋮ Lov\'asz Meets Weisfeiler and Leman ⋮ Graph Similarity and Approximate Isomorphism ⋮ De-anonymization of heterogeneous random graphs in quasilinear time ⋮ The Complexity of Homomorphism Indistinguishability

This page was built for publication: Approximate Graph Isomorphism