The difficulty of testing for isomorphism against a graph that is given in advance

DOI10.1145/1007352.1007415zbMath1192.68857OpenAlexW2019325601MaRDI QIDQ3580984

Eldar Fischer

Publication date: 15 August 2010

Published in: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1007352.1007415

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Randomized algorithms (68W20) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (1)

Partially Symmetric Functions Are Efficiently Isomorphism Testable

This page was built for publication: The difficulty of testing for isomorphism against a graph that is given in advance