公开(公告)号：US20140118355A1

公开(公告)日：2014-05-01

申请号：US14065108

申请日：2013-10-28

Applicant: Yahoo! Inc.

Inventor： Sergei Vassilvitskii ,  Shanmugasundaram Ravikumar ,  Bahman Bahmani

IPC: G06T11/20

CPC classification number: G06T11/206 ,  G06F17/30958

Abstract: Methods and systems for generating a dense graph are described. One of the methods includes receiving a graph and computing a threshold to apply to the graph. The method further includes determining whether the graph includes a first set of at least one node, determining whether a second set of at least one node from the first set meets the threshold, and removing the at least one node of the second set concurrently from the graph upon determining that the at least one node of the second set meets the threshold. The operation of removing is performed to generate an updated graph. The method includes determining whether a density of the updated graph is greater than a density of the graph and replacing the graph within the updated graph upon determining that the density of the updated graph is greater than the density of the density of the graph.

Abstract translation: 描述了生成密集图的方法和系统。 其中一种方法包括接收图形并计算应用于图形的阈值。 该方法还包括确定图形是否包括至少一个节点的第一组，确定来自第一组的至少一个节点的第二组是否满足阈值，以及从第一集合中同时移除第二组中的至少一个节点 确定第二组的至少一个节点满足阈值时的图表。 执行去除的操作以生成更新的图。 该方法包括确定更新图的密度是否大于图的密度，并且在确定更新图的密度大于图的密度的密度时，更新更新图中的图。

公开(公告)号：US09652875B2

公开(公告)日：2017-05-16

申请号：US14065108

申请日：2013-10-28

Applicant: Yahoo! Inc.

Inventor： Sergei Vassilvitskii ,  Shanmugasundaram Ravikumar ,  Bahman Bahmani

IPC: G06T11/20 ,  G06F17/30

CPC classification number: G06T11/206 ,  G06F17/30958

Abstract: Methods and systems for generating a dense graph are described. One of the methods includes receiving a graph and computing a threshold to apply to the graph. The method further includes determining whether the graph includes a first set of at least one node, determining whether a second set of at least one node from the first set meets the threshold, and removing the at least one node of the second set concurrently from the graph upon determining that the at least one node of the second set meets the threshold. The operation of removing is performed to generate an updated graph. The method includes determining whether a density of the updated graph is greater than a density of the graph and replacing the graph within the updated graph upon determining that the density of the updated graph is greater than the density of the density of the graph.