Power-law graph clustering algorithm based on skeleton subgraph
Qingxian Wang, Pla Information · Jisuanji yingyong yanjiu · 2008
Power-law graph can be segmented into a skeleton graph and several sub trees with recursively hung vertexes filetering.Skeleton sub-graph is a set of relatively important vertexes with high degree,sub trees are just in the opposite situation.Power-law characteristic guarantees the non-uniform distribution of nodes' degree.Based on this characteristic,this paper defined some related concepts of skeleton graph.The clustering algorithm based on skeleton sub-graph could be divided into two parts:skeleton sub-graph generation algorithm and stub tree growing algorithm.The homomorphically equivalence between skeleton sub-graph Gs(Vs,Es) and original graph G(V,E) guaranteed Gs inheriented most characteristics from G,which ensured this clustering algorithm could be applied to the hybrid layout of large graph with power-law characteristic.Meanwhile,it could also supply certain reference to the research of power-law network.