Algorithm 2.

Frequent Pattern Mining Algorithm

1:	procedure pattern_mining($D{S}^N,{min}_{\mathit{freq}}$)
2:	one_vertex: Set of vertices in $D{S}^N$ with frequencies ${\ge min}_{\mathit{freq}}$
3:	one_edge: Set of unique edges in $D{S}^N$ with frequencies ${\ge min}_{\mathit{freq}}$
4:	frequent_patterns = {one_vertex,one_edge}
5:	procedure frequent_pattern_mining(${min}_{freq,}$,candidate)
6:	if is_valid(candidate) then ▷ If candidate is the representative of all the networks isomorphic to candidate.
7:	frequent_pattern ← candidate
8:	Append frequent_pattern to frequentl_patterns
9:	Extend frequent_pattern with edges in one_edge → candidates
10:	for candidate ∈ candidates do
11:	$frequency=\{N_{id}\mid N_{id}\in 𝒟{𝒮}^{𝒩}\wedge candidate\subseteq N_{id}\}$
12:	if $\left|frequency\right|\ge {min}_{\mathit{freq}}$ then
13:	FREQUENT_PATTERN_MINING(${min}_{freq,}$,candidate)
14:	for e ∈ one_edge do FREQUENT_PATTERN_MINING(${min}_{freq,}e$)
15:	Return frequent_patterns