Our study of subgraph pattern mining has been on how to mine frequent substructures from a collection of graph data sets. The current Web page structures (e.g., Wikipedia) or social networks may form one or a small number of gigantic network structures. One may need to find frequent common substructures from one gigantic network. Outline an efficient method that finds top- \(k\) large substructural patterns in a massive network.