Representing Equivalence Problems for Combinatorial Objects
Iliya Bouyukliev, Mariya Dzhumalieva-Stoeva · Serdica Journal of Computing · 2015
Methods for representing equivalence problems of various combinatorial objectsas graphs or binary matrices are considered. Such representations can be used for isomorphism testing in classification or generation algorithms. Often it is easier to consider a graph or a binary matrix isomorphism problem than to implement heavy algorithms depending especially on particular combinatorialobjects. Moreover, there already exist well tested algorithms for the graph isomorphismproblem (nauty) and the binary matrix isomorphism problem as well (Q-Extension).ACM Computing Classification System (1998): F.2.1, G.4.