Table 3 Impact of the pruning strategies on the number of search nodes explored
From: RASMA: a reverse search algorithm for mining maximal frequent subgraphs
sup | maximal | Without Pruning | RASMA | ||
|---|---|---|---|---|---|
Smin | \(|\mathcal {M}|\) | #Nodes | Seconds | #Nodes | Seconds |
20 | 4,701 | 214,119 | 0.35 | 13,869 | 0.34 |
19 | 6,463 | 599,798 | 2.54 | 20,529 | 0.35 |
18 | 9,038 | 1,776,157 | 8.18 | 31,442 | 0.45 |
17 | 12,879 | 9,040,719 | 51.46 | 49,880 | 0.59 |
16 | 18,978 | 2,968,677,772 | 21,031.44 | 82,607 | 0.92 |