%0 Journal Article
%T Power-law graph clustering algorithm based on skeleton subgraph<br>基于主干子图的幂律特征图聚类算法
%A ZHANG Wei-ming
%A ZHANG Kai
%A WANG Qing-xian
%A <br>张伟明
%A 张凯
%A 王清贤
%J 计算机应用研究
%D 2008
%I 
%X 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.
%K graph drawing
%K skeleton subgraph
%K clustering
%K power-law<br>绘图
%K 主干子图
%K 聚类
%K 幂律
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=A9D9BE08CDC44144BE8B5685705D3AED&aid=2AD67B70A4913D01D819CD332D10D554&yid=67289AFF6305E306&vid=C5154311167311FE&iid=9CF7A0430CBB2DFD&sid=960FAAFDFF4DC10B&eid=0C855F950D3C0D58&journal_id=1001-3695&journal_name=计算机应用研究&referenced_num=0&reference_num=6