摘要
本文探讨将图的可迁闭包算法,大型稀疏矩阵的优化压缩存储技术应用于布尔矩阵乘。并且根据两相乘布尔矩阵A,B的不同情况,提出不同的处理方法,得出了几个实用的处理布尔矩阵乘的较优算法,
Using the transitive closure computation algorithm and effective optimizing compressing storage method about large sparse matrix elements to Boolean matrix multiplication and based on the araiysis about two N * N Boolean matrices, A and B, we bring forth effective computation algorithms for Bool-ean matrix multiplication.
出处
《成都信息工程学院学报》
1989年第1期73-80,共8页
Journal of Chengdu University of Information Technology
关键词
布尔矩阵
可迁闭包算法
压缩存储
Boolean matrix
Transitive closure computation algorithm
Compressing storage.
