no code implementations • 5 Feb 2024 • Kenta Yanagiya, Junya Hara, Hiroshi Higashi, Yuichi Tanaka, Antonio Ortega
In this paper, we propose a lossy compression of weighted adjacency matrices, where the binary adjacency information is encoded losslessly (so the topological information of the graph is preserved) while the edge weights are compressed lossily.
