...DFS lexicographic order [208]. Although gSpan produced a competitive performance to other algorithms, it was found that it does not operates well on large graph datasets with a small number of labels =-=[106]-=-. To address this issue, WFSM was employed with respect to the work described in this chapter. 149Procedure subGraphMining(c, σ, D, F) 1 if c = min(c) then 2 return; 3 end 4 F ← F ∪ c; 5 G ← ⊘; 6 Sc...