This page contains the source code, benchmark instances, and
summary of results for the experiments in the paper
"Engineering an Efficient Canonical Labeling Tool for Large and Sparse Graphs"
by Tommi Junttila and Petteri Kaski,
accepted to the
ALENEX 2007 workshop.
- The source code of the proposed tool bliss (version 0.35)
is available here.
It is licenced under GNU GPL.
- The benchmark graphs are available here.
The graphs are in the DIMACS format, the tar-ball also includes
perl scripts to convert graphs to nauty and saucy formats.
- The table summarizing the results is available
- Scatter plots showing the comparisons between
search tree nodes and