Search for Articles:

MECS Press Menu

Krasimir Yankov Yordzhev

Work place: Faculty of Mathematics and Natural Sciences, South-West University ―N. Rilsky‖, Blagoevgrad, Bulgaria

E-mail: yordzhev@swu.bg

Website:

Research Interests: Computer systems and computational processes, Data Structures and Algorithms, Analysis of Algorithms, Combinatorial Optimization

Biography

Prof. Dr. Krasimir Yordzhev is a lecturer in computer science, programming and discrete mathematics at the Department of Computer Science, Faculty of Mathematics and Natural Sciences, South-West University, Blagoevgrad, Bulgaria. In research, his current interests include theoretical computer science and in particular the study of algorithms and their complexity using analytical, combinatorial or probabilistic methods. Dr. Yordzhev received his PhD degree in the Faculty of Cybernetics, Kiev State University, Ukraine. He is a member of Editorial Board of International Journal of Modern Education and Computer Science (IJMECS) and Associate Editor of International Journal of Education and Management Engineering (IJEME).

Author Articles
Bitwise Operations Related to a Combinatorial Problem on Binary Matrices

By Krasimir Yankov Yordzhev

DOI: https://doi.org/10.5815/ijmecs.2013.04.03, Pub. Date: 8 Apr. 2013

Some techniques for the use of bitwise operations are described in the article. As an example, an open problem of isomorphism-free generations of combinatorial objects is discussed. An equivalence relation on the set of square binary matrices having the same number of units in each row and each column is defined. Each binary matrix is represented using ordered n-tuples of natural numbers. It is shown how by using the bitwise operations can be implemented an algorithm that gets canonical representatives which are extremal elements of equivalence classes relative to a double order on the set of considered objects.

 

[...] Read more.
Other Articles

Subscribe to receive issue release notifications and newsletters from MECS Press journals