Practical graph isomorphism, II

Brendan D. McKay*, Adolfo Piperno

*Corresponding author for this work

    Research output: Contribution to journalArticlepeer-review

    897 Citations (Scopus)

    Abstract

    We report the current state of the graph isomorphism problem from the practical point of view. After describing the general principles of the refinement-individualization paradigm and pro ving its validity, we explain how it is implemented in several of the key implementations. In particular, we bring the description of the best known program nauty up to date and describe an innovative approach called Traces that outperforms the competitors for many difficult graph classes. Detailed comparisons against saucy, Bliss and conauto are presented.

    Original languageEnglish
    Pages (from-to)94-112
    Number of pages19
    JournalJournal of Symbolic Computation
    Volume60
    DOIs
    Publication statusPublished - Jan 2014

    Fingerprint

    Dive into the research topics of 'Practical graph isomorphism, II'. Together they form a unique fingerprint.

    Cite this