A Generic Framework for Engineering Graph Canonization Algorithms

DOI10.1137/1.9781611975055.13zbMath1429.68168arXiv1711.08289OpenAlexW3095513762MaRDI QIDQ5232733

Jakob L. Andersen, Daniel Merkle

Publication date: 12 September 2019

Published in: ACM Journal of Experimental Algorithmics, 2018 Proceedings of the Twentieth Workshop on Algorithm Engineering and Experiments (ALENEX) (Search for Journal in Brave)

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

zbMATH Keywords

graph isomorphismgraph canonizationgeneric programming

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items

Comparison of Atom Maps ⋮ GraphCanon

Uses Software

• nauty
• Boost
• PermGroup

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Practical graph isomorphism. II.
• Conflict Propagation and Component Recursion for Canonical Labeling
• A Software Package for Chemically Inspired Graph Transformation
• Symmetry and Satisfiability: An Update
• Benchmark Graphs for Practical Graph Isomorphism
• Isomorphism Test for Digraphs with Weighted Edges.
• Canonical form for graphs in quasipolynomial time: preliminary report
• Engineering an Efficient Canonical Labeling Tool for Large and Sparse Graphs
• Graph isomorphism in quasipolynomial time [extended abstract]