Engineering a Fast Probabilistic Isomorphism Test

DOI10.1137/1.9781611976472.6MaRDI QIDQ5147527zbMATH OpenOpenAlexFDO

Authors Markus Anders, P. Schweitzer

Publication date 27 January 2021

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

Full work available at URL https://arxiv.org/abs/2011.09375

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(4)

• A proof system for graph (non)-isomorphism verification
• Comparative design-choice analysis of color refinement algorithms beyond the worst case
• Search problems in trees with symmetries: near optimal traversal strategies for individualization-refinement algorithms
• Satsuma: structure-based symmetry breaking in SAT

This page was built for publication: Engineering a Fast Probabilistic Isomorphism Test

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