Pith. sign in

REVIEW 1 cited by

Practical graph isomorphism, II

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1301.1493 v1 pith:7UIIQ3NB submitted 2013-01-08 cs.DM math.CO

classification cs.DMmath.CO
keywords graphisomorphismpracticalapproachbestblissbringcalled
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original 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 proving its validity, we explain how it is implemented in several of the key programs. 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.

Discussion (0). Sign in to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Anomalous dimensions and critical exponents for the Gross-Neveu-Yukawa model at five loops

    hep-th 2025-07 conditional novelty 7.0 of 10

    First five-loop renormalization group functions for the O(N) Gross-Neveu-Yukawa model, yielding refined, resummed critical exponent estimates for N=1, 2, and 5.

Pith tools