Engineering an Efficient Canonical Labeling Tool for Large and Sparse Graphs
Tommi A. Junttila, Petteri Kaski · Society for Industrial and Applied Mathematics eBooks · 2007
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.