☆
Compressing Large Boolean Matrices Using Reordering Techniques
Download
Authors: David Johnson, Shankar Krishnan, Jatin Chhugani, Subodh Kumar, Suresh Venkatasubramanian
Liked by:
Domains: Graph compression
Tags: Graph compression
Uploaded by: Alt-Tab
Upload date: 2021-06-25 12:18:27

Comments:

I have read this paper some time ago: - They want to permute the rows (or columns) or a matrix the ones in a column (or row respectively) follow a rather consecutive pattern i.e., they want to minimize the number of 1-blocks -They produce a TSP-inspired heuristic
Reply
IoannisPan at 2021-06-27 10:17:52

Please consider to register or login to comment on the paper.