Detecting overlapping communities in linear time with P&A algorithm
msra(2005)
摘要
This paper describes a new algorithm - P&A algorithm - utilized in
identifying overlapping communities in non oriented valued graph regardless of
their number or their size. The complexity of this algorithm is minimal in the
matter that the number of operations grows linearly with the number of
vertices.
更多查看译文
关键词
linear time
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要