Fig. 2From: RASMA: a reverse search algorithm for mining maximal frequent subgraphsMining Frequent Subgraphs: (a) Graph dataset (b) A summary graph representation and a table representing the edge attribute function f for mapping edges to the graphs in which they appear (c) Frequent and maximal frequent subgraphs with minimum support 3Back to article page