Fast determination of structurally cohesive subgroups in large networks

详细信息    查看全文

• 作者：Robert S. Sinkovits^a ; ^{sinkovit@sdsc.edu}Author Vitae ; James Moody^b ; ^cAuthor Vitae ; B. Tolga Oztan^dAuthor Vitae ; Douglas R. White^dAuthor Vitae
• 关键词：Graph algorithm ; Social network ; Cohesive subgroup ; Vertex separator
• 刊名：Journal of Computational Science
• 出版年：2016
• 出版时间：November 2016
• 年：2016
• 卷：17
• 期：part_P1
• 页码：62-72
• 全文大小：1771 K
• 卷排序：17

文摘

Cohesive subgroups can be quickly identified in much larger graphs. An iterative approach gradually reduces complexity of graph. New algorithm developed to quickly find 3-vertex separators. Software builds on implementation of existing primitive operations. Framework allows integration of faster algorithms for sub-steps.