|igraph Reference Manual|
igraph_bliss_sh_t— Splitting heuristics for BLISS
igraph_bliss_info_t— Information about a BLISS run
igraph_canonical_permutation— Canonical permutation using BLISS
igraph_isomorphic_bliss— Graph isomorphism via BLISS
igraph_automorphisms— Number of automorphisms using BLISS
BLISS is a successor of the famous NAUTY algorithm and implementation. While using the same ideas in general, with better heuristics and data structure BLISS outperforms NAUTY on most graphs.
BLISS was developed and implemented by Tommi Junttila and Petteri Kaski at Helsinki University of Technology, Finland. See Tommi Juntilla's homepage at http://www.tcs.hut.fi/~tjunttil/ and the publication at http://www.siam.org/proceedings/alenex/2007/alx07_013junttilat.pdf for more information.
BLISS version 0.35 is included in igraph.