# Representing Equivalence Problems for Combinatorial Objects

Bouyukliev, Iliya; Dzhumalieva-Stoeva, Mariya

Serdica Journal of Computing (2014)

- Volume: 8, Issue: 4, page 327-354
- ISSN: 1312-6555

## Access Full Article

top## Abstract

top## How to cite

topBouyukliev, Iliya, and Dzhumalieva-Stoeva, Mariya. "Representing Equivalence Problems for Combinatorial Objects." Serdica Journal of Computing 8.4 (2014): 327-354. <http://eudml.org/doc/281508>.

@article{Bouyukliev2014,

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.},

author = {Bouyukliev, Iliya, Dzhumalieva-Stoeva, Mariya},

journal = {Serdica Journal of Computing},

keywords = {Isomorphisms; Graphs; Binary Matrices; Combinatorial Objects},

language = {eng},

number = {4},

pages = {327-354},

publisher = {Institute of Mathematics and Informatics Bulgarian Academy of Sciences},

title = {Representing Equivalence Problems for Combinatorial Objects},

url = {http://eudml.org/doc/281508},

volume = {8},

year = {2014},

}

TY - JOUR

AU - Bouyukliev, Iliya

AU - Dzhumalieva-Stoeva, Mariya

TI - Representing Equivalence Problems for Combinatorial Objects

JO - Serdica Journal of Computing

PY - 2014

PB - Institute of Mathematics and Informatics Bulgarian Academy of Sciences

VL - 8

IS - 4

SP - 327

EP - 354

AB - 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.

LA - eng

KW - Isomorphisms; Graphs; Binary Matrices; Combinatorial Objects

UR - http://eudml.org/doc/281508

ER -

## NotesEmbed ?

topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.