REVIEW 3 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
Signed reviews
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.
Forward citations
Cited by 3 Pith papers
-
Anomalous dimensions and critical exponents for the Gross-Neveu-Yukawa model at five loops
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.
-
Graph theoretic properties of Speyer's matroid polynomial $g_M(t)$
For graphic and cographic matroids, the derivative g'_M(-1) equals (-1)^{c(M)-1} c(M), and computational data suggests many new properties of the coefficient N2.
-
Point-transitive Steiner systems S(2,6,111/121/126), S(2,7,169/175)
Explicit difference families and block lists are given for new point-transitive Steiner systems S(2,6,111), S(2,6,121), S(2,6,126), S(2,7,169), and S(2,7,175), including an exhaustive count of 30 systems on 111 points.
Discussion (0). Continue with ORCID to comment.