全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...

Power-law graph clustering algorithm based on skeleton subgraph
基于主干子图的幂律特征图聚类算法

Keywords: graph drawing,skeleton subgraph,clustering,power-law
绘图
,主干子图,聚类,幂律

Full-Text   Cite this paper   Add to My Lib

Abstract:

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.

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133