摘要
现实中很多复杂网络是由完全子图通过公共的节点连接而成的.本文提出了一个复杂网络中完全子图的搜索算法,并通过实例说明了所提算法的有效性.
Many complex networks are composed of complete sub - graphs connected through their communal verti- ces. In this paper an algorithm for detecting complete sub - graphs in complex networks is proposed. The effective- ness of the proposed algorithm is illustrated through an example.
出处
《数学理论与应用》
2013年第3期72-75,共4页
Mathematical Theory and Applications
关键词
复杂网络
完全子图
节点度
搜索算法
Complex Network Complete Sub -graph Degree Distribution Detecting Algorithm