Premium
An assessment of a new technique for the representation of boolean matrices
Author(s) -
Dodd W. P.
Publication year - 1982
Publication title -
software: practice and experience
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.437
H-Index - 70
eISSN - 1097-024X
pISSN - 0038-0644
DOI - 10.1002/spe.4380120203
Subject(s) - representation (politics) , computer science , logical matrix , element (criminal law) , matrix (chemical analysis) , theoretical computer science , matrix representation , algorithm , sparse approximation , group (periodic table) , chemistry , materials science , organic chemistry , politics , political science , law , composite material
A general‐purpose method, based on a sparse matrix approach, is proposed for the representation of boolean matrices, and algorithms are presented both for representation formation and element access. The method is then compared with the bit‐map approach using the criteria of storage requirements, element access time, and execution time for logical operations on the whole matrix. Finally the conditions are discussed under which the proposed method may be profitably used in preference to the bit‐map approach.