Parallel constructing of the shortest coverings of large Boolean matrices
Keywords:
Boolean matrix, shortest covering, decomposition, sequential algorithm, parallel algorithm, clusterAbstract
The paper presents two options of the parallel algorithm for finding the shortest covering of a large Boolean matrix, where the decomposition of the initial matrix into matrices of smaller sizes is based on the partitioning of rows. The parallel algorithm COVMB contains sequential algorithms for partitioning of initial m × n Boolean matrix on submatrices, building special matrices, summering of the shortest coverings of special Boolean matrices with smaller sizes as well as the sequential algorithm SECNOP for finding the shortest coverings of smaller Boolean matrices.
Downloads
Download data is not yet available.
Downloads
Published
2019-05-06
How to Cite
Novikov, S. (2019). Parallel constructing of the shortest coverings of large Boolean matrices. Studia Informatica. System and Information Technology, 20(1-2), 27–37. Retrieved from https://czasopisma.uph.edu.pl/studiainformatica/article/view/188
Issue
Section
Article