ScrewBox: a randomized certifying graph-non-isomorphism algorithm

DOI10.1137/1.9781611972870.14MaRDI QIDQ5233501zbMATH OpenOpenAlexFDO

Authors P. Schweitzer, Martin Kuetz

Publication date 11 September 2019

Published in 2007 Proceedings of the Ninth Workshop on Algorithm Engineering and Experiments (ALENEX) (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/1.9781611972870.14

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)

Recommendations

• Attacks on hard instances of graph isomorphism
• Practical graph isomorphism. II.
• Benchmark Graphs for Practical Graph Isomorphism
• New invariants for the graph isomorphism problem
• Algorithms for the graph isomorphism problem based on graph deregularisation

Cited in

(2)

• Attacks on hard instances of graph isomorphism
• Constructing hard examples for graph isomorphism

This page was built for publication: ScrewBox: a randomized certifying graph-non-isomorphism algorithm

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