Fig. 3
From: RASMA: a reverse search algorithm for mining maximal frequent subgraphs
Mining Frequent and Maximal frequent Subgraphs: (a) A graph dataset of four graphs in the edge-attributed graph format (b) Enumeration tree for frequent subgraph with minimum support set to 3; maximal frequent subgraphs are circled with dotted line; all the subtrees with the light gray background are pruned when mining for only maximal frequent subgraphs in the proposed algorithm