|igraph Reference Manual|
igraph provides four set of functions to deal with graph isomorphism problems.
functions make up the first set (in addition with the
igraph_permute_vertices() function). These functions choose the
algorithm which is best for the supplied input graph. (The choice is
not very sophisticated though, see their documentation for
Functions for the BLISS algorithm constitute the third set,
igraph_isomorphic_bliss(). This implementation only works
for undirected graphs.
Finally, the isomorphism classes of all graphs with three and
four vertices are precomputed and stored in igraph, so for these
small graphs there is a very simple fast way to decide isomorphism.
|<< Chapter 12. Graph Isomorphism||1.1.