Before revision:  A new partition-based reordering algorithm is proposed for aggregating non-zero elements of the graphs into fewer but denser tiles in order to improve the efficiency of the sparse format. We carried out extensive theoretical analyses on the graph tensor product primitives between tiles of various density , and evaluated their performance on synthetic and real-world datasets.
After revision:  A new partition-based reordering algorithm is proposed for aggregating non-zero elements of the graphs into fewer but denser tiles to further exploit sparsity. We carry out extensive theoretical analyses on the graph tensor product primitives between tiles of various density , and evaluated their performance on synthetic and real-world datasets.