Table 1 Running times (in seconds) of the MULE and RASMA algorithms
From: RASMA: a reverse search algorithm for mining maximal frequent subgraphs
sup | Frequent subgraphs | Maximal subgraphs | ||||
|---|---|---|---|---|---|---|
Smin | \(|\mathcal {F}|\) | MULE | Algorithm 2 | \(|\mathcal {M}|\) | MULE | RASMA |
20 | 214,119 | 0.93 | 0.46 | 4,701 | 5.25 | 0.34 |
19 | 599,798 | 1.02 | 0.65 | 6,463 | 12.32 | 0.35 |
18 | 1,776,157 | 2.01 | 1.60 | 9,038 | 50.75 | 0.45 |
17 | 9,040,719 | 7.79 | 7.50 | 12,879 | 241.19 | 0.59 |
16 | 2,968,677,772 | 2880 | 1718 | 18,978 | 1877.95 | 0.92 |
15 | - | - | - | 28,578 | - | 3.50 |