Before revision:  Compared to the state-of-the-art parallel k-clique counting algorithms, we achieve a 1.31-9.88 x speedup, and compared to existing implementations of k-clique densest subgraph, we achieve a 1.01-11.83 x speedup.
After revision:  Compared to the state-of-the-art parallel k-clique counting algorithms, we achieve up to 9.88 x speedup, and compared to existing implementations of k-clique densest subgraph, we achieve a 1.01-11.83 x speedup.