Table 1.
Test networks used in our experiments, along with their statistics.
The networks are already pruned using the largest K–core value, and are obtained from the Network Repository [37].
Table 2.
Node pruning results that provide an optimal solution on the real-world network instances already pruned using the K–core.
For the speedup, we enumerate the cliques ten times on both the original and pruned instances, and take the ratio between the minimum CPU time. The node pruning rate is the ratio of nodes predicted to not be part of a maximum clique, while the edge pruning rate is the ratio of edges removed as a direct consequence of the removal of nodes. The solver time columns are the time taken by the exact clique solver before and after the pruning (in seconds), while the s column is the speedup.
Table 3.
Node pruning results that keep at least one maximum clique on the real-world network instances already pruned using the K–core.
For the speedup, we enumerate the cliques ten times on both the original and pruned instances, and take the ratio between the minimum CPU time. The node pruning rate is the ratio of nodes predicted to not be part of a maximum clique, while the edge pruning rate is the ratio of edges removed as a direct consequence of the removal of nodes. The solver time columns are the time taken by the exact clique solver before and after the pruning (in seconds), while the s column is the speedup. The % column is the similarity measure defined in subsection Performance measures, and quantifies the percentage of maximum cliques retained by the pre-processing step.