Engineering an efficient canonical labeling tool for large and sparse graphs (2007)


Abstract: The problem of canonically labeling a graph is studied. Within the general framework of backtracking algorithms based on individualization and refinement, data structures, subroutines, and pruning heuristics especially for fast handling of large and sparse graphs are developed. Experiments indicate that the algorithm implementation in most cases clearly outperforms existing state-of-the-art tools.

This is the paper for bliss.

It looks like Bliss recently moved to a new home at a new site after 6 years of no releases.