Theexponentialnumberofpossiblesubgraphsmakestheproblemoffrequentsubgraphminingachallenge.Thesetofmaximalfrequentsubgraphsismuchsmallertothatofthesetoffrequentsubgraphs,thusprovidingamplescopeforpruning.MARGINisamaximalsubgraphminingalgorithmthatmovesamongpromisingnodesofthesearchs