From: RASMA: a reverse search algorithm for mining maximal frequent subgraphs
Smin | \(|\mathcal {M}|\) | \(|\mathcal {M^{*}}|\) | \(\overline {|E|}\) | \(\overline {|V|}\) | \(\overline {Density}\) | Seconds |
---|---|---|---|---|---|---|
15 | 28,578 | 17,855 | 14.78 | 15.36 | 0.2 | 3.50 |
14 | 43,773 | 30,094 | 16.33 | 16.82 | 0.19 | 4.20 |
13 | 67,978 | 50,227 | 18.17 | 18.53 | 0.17 | 7.65 |
12 | 105,950 | 82,831 | 20.22 | 20.42 | 0.16 | 15.75 |
11 | 164,613 | 134,245 | 22.42 | 22.41 | 0.15 | 37.53 |
10 | 252,345 | 211,678 | 24.75 | 24.47 | 0.15 | 92.38 |
9 | 378,437 | 322,381 | 27.1 | 26.45 | 0.15 | 241.65 |
8 | 549,709 | 470,572 | 29.03 | 27.93 | 0.16 | 669.25 |
7 | 774,221 | 659,303 | 29.36 | 27.82 | 0.18 | 1958.77 |