where the minimum is taken over all possible partitions P of the vertex set of H, and E(H/P) is the set of edges crossing between parts of P. The subgraphs H found are identified as a level-k community if they are maximal, which means that there are no larger subgraphs containing it that satisfy the dynamic “edge-to-vertex” ratio for the same k. All level-k communities are output."/>
公开/公告号US7523117B2
专利类型
公开/公告日2009-04-21
原文格式PDF
申请/专利权人 CUN-QUAN ZHANG;YONGBIN OU;
申请/专利号US20060416766
申请日2006-05-03
分类号G06F17;
国家 US
入库时间 2022-08-21 19:29:57