A Generic Framework for Engineering Graph Canonization Algorithms

@article{Andersen2018AGF,
  title={A Generic Framework for Engineering Graph Canonization Algorithms},
  author={Jakob L. Andersen and D. Merkle},
  journal={ArXiv},
  year={2018},
  volume={abs/1711.08289}
}
  • Jakob L. Andersen, D. Merkle
  • Published 2018
  • Computer Science, Mathematics
  • ArXiv
  • The state-of-the-art tools for practical graph canonization are all based on the individualization-refinement paradigm, and their difference is primarily in the choice of heuristics they include and in the actual tool implementation. It is thus not possible to make a direct comparison of how individual algorithmic ideas affect the performance on different graph classes. We present an algorithmic software framework that facilitates implementation of heuristics as independent extensions to a… CONTINUE READING

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 21 REFERENCES
    Practical graph isomorphism, II
    • 1,084
    • Highly Influential
    • PDF
    The Boost Graph Library - User Guide and Reference Manual
    • 696
    • PDF
    Generic Programming
    • 348
    • PDF
    Engineering an Efficient Canonical Labeling Tool for Large and Sparse Graphs
    • 201
    • Highly Influential
    • PDF
    Canonical labeling of graphs
    • 380
    • PDF
    The generic graph component library
    • 67
    • PDF
    Graph isomorphism in quasipolynomial time [extended abstract]
    • L. Babai
    • Mathematics, Computer Science
    • 2016
    • 154
    Search Space Contraction in Canonical Labeling of Graphs (Preliminary Version)
    • 51
    • PDF
    Faster symmetry discovery using sparsity of symmetries
    • 98
    • Highly Influential
    • PDF
    Permutation Group Algorithms
    • 299
    • PDF