Figure 2
From: A core-attachment based method to detect protein complexes in PPI networks
The diagram of our Core-removal algorithm. In this example, we assume that (A) shows the core graph of vertex 1's neighborhood graph, denoted as CG1. The density and average degree of CG1 is 0.607 and 4.25 respectively. In (B), the core vertices of CG1, {1, 6}, are removed from CG1 and two connected components are left in the remaining graph. In (C), {1, 6} are added back into each connected component. Two subgraphs with vertices {1,2,3,4,5,6} and {1,6,7,8} are obtained and finally returned.