Engineering an Efficient Canonical Labeling Tool for Large and Sparse Graphs

By Tommi A. Junttila, Petteri Kaski. Workshop on Algorithm Engineering and Experimentation, 2007

323 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Detecting Similar Programs via The Weisfeiler-Leman Graph Kernel (2016, methodology): “The procedure is for example employed in the currently fastest practical isomorphism solvers (such as Nauty and Traces [18], Bliss [11] and saucy [4]).”
Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement (2013, methodology): “Our data structures are similar to those described by Junttila and Kaski [8].”
Practical graph isomorphism, II (2013, unknown): “A limited form of this idea appeared in Bliss (Junttila and Kaski, 2007), and also appears in a recent version of saucy (Darga et al.”
On the Relationships between Generative Encodings, Regularity, and Learning Abilities when Evolving Plastic Artificial Neural Networks (2013, methodology): “In the present work, we use the Bliss library [45].”