1:28 PM
Section 8 "Component Recursion" talks about a mechanism that can be used as addition to an individualization-refinement algorithm improving their performance. It is said that this mechanism is implemented in the newest version of bliss. I guess this is related to the "NON-DISJOINT UNION OF TRIPARTITE GRAPHS" benchmark graphs, where bliss, nauty, conauto, sausy, and Traces show interesting differences in behaviour between automorphism and canonical labelling (and between the different solvers).
« first day (127 days earlier) ← previous day next day → last day (445 days later) »
Transcript for
Aug3
Aug '1712
Aug14
amateur reviews
paper reviews and discussions about non-peer-reviewed or contr...