Fast maximum group and maximum group searching method for social network

The invention discloses a fast maximum group and maximum group searching method for a social network. The method comprises the steps of layering nodes of the social network according to kernel values; constructing a corresponding upper bound complete export subgraph for the layered nodes; searching the maximum clique in the upper bound complete export subgraph by adopting a maximum clique search algorithm; and/or searching a maximum clique in the upper bound complete export sub-graph by adopting a maximum clique search algorithm. A large social network is divided into small social networks in a layering manner, so that the problems that the large social network is difficult to calculate and the calculation time is too long are solved; meanwhile, the upper bound complete export sub-graph constructed by the split small social network retains the original large social network group structure and also can perform parallel analysis, so that the time complexity and the requirement on equipment of the existing socia