BulDML at Institute of Mathematics and Informatics >
IMI Periodicals >
Serdica Journal of Computing >
2014 >
Volume 8 Number 4 >

Please use this identifier to cite or link to this item:

Title: Representing Equivalence Problems for Combinatorial Objects
Authors: Bouyukliev, Iliya
Dzhumalieva-Stoeva, Mariya
Keywords: Isomorphisms
Binary Matrices
Combinatorial Objects
Issue Date: 2014
Publisher: Institute of Mathematics and Informatics Bulgarian Academy of Sciences
Citation: Serdica Journal of Computing, Vol. 8, No 4, (2014), 327p-354p
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.
ISSN: 1312-6555
Appears in Collections:Volume 8 Number 4

Files in This Item:

File Description SizeFormat
sjc-vol8-num4-2014-p327-p354.pdf281.68 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.


Valid XHTML 1.0!   Creative Commons License