首页>
外国专利>
FINDING COMMON NEIGHBORS BETWEEN TWO NODES IN A GRAPH
FINDING COMMON NEIGHBORS BETWEEN TWO NODES IN A GRAPH
展开▼
机译:在图中找到两个节点之间的共同点
展开▼
页面导航
摘要
著录项
相似文献
摘要
Techniques for identifying common neighbors of two nodes in a graph are provided. One technique involves performing a binary split search and/or a linear search. Another technique involves creating a segmenting index for a first neighbor list. A second neighbor list is scanned and, for each node indicated in the second neighbor list, the segmenting index is used to determine whether the node is also indicated in the first neighbor list. Techniques are also provided for counting the number of triangles. One technique involves pruning nodes from neighbor lists based on the node values of the nodes whose neighbor lists are being pruned. Another technique involves sorting the nodes in a node array (and, thus, their respective neighbor lists) based on the nodes' respective degrees prior to identifying common neighbors. In this way, when pruning the neighbor lists, the neighbor lists of the highly connected nodes are significantly reduced.
展开▼