Representing Equivalence Problems for Combinatorial Objects

Authors

  • Iliya Bouyukliev Institute of Mathematics and Informatics Bulgarian Academy of Sciences P.O. Box 323 5000 Veliko Tarnovo, Bulgaria
  • Mariya Dzhumalieva-Stoeva Faculty of Mathematics and Informatics Veliko Tarnovo University 2, Theodosi Tarnovski Str. 5000 Veliko Tarnovo, Bulgaria

Keywords:

Isomorphisms, Graphs, Binary Matrices, Combinatorial Objects

Abstract

Methods for representing equivalence problems of various combinatorial objects
as 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 combinatorial
objects. Moreover, there already exist well tested algorithms for the graph isomorphism
problem (nauty) and the binary matrix isomorphism problem as well (Q-Extension).

ACM Computing Classification System (1998): F.2.1, G.4.

Downloads

Published

2022-04-13

Issue

Section

Articles