发明名称 EFFICIENT EGONET COMPUTATION IN A WEIGHTED DIRECTED GRAPH
摘要 An embodiment of the invention pertains to a weighted directed graph comprising multiple nodes and edges that each extends between two nodes. The embodiment includes processing edges to generate a forward and reverse edge corresponding to each edge. Forward and reverse edges are processed to generate indirect edges, each comprising two edge components, and extending between two nodes. One node associated with each forward edge, each reverse edge, and each indirect edge is selected to be the key node of its associated edge. All forward, reverse and indirect edges having a particular node as their respective key nodes are placed into a group. All edges of the group are then selectively processed to provide information pertaining to an egonet of the graph that has the particular node as its egonode.
申请公布号 US2014067873(A1) 申请公布日期 2014.03.06
申请号 US201213533697 申请日期 2012.06.26
申请人 ROSU MARCEL C.;TONG HANGHANG;INTERNATIONAL BUSINESS MACHINES CORPORATION 发明人 ROSU MARCEL C.;TONG HANGHANG
分类号 G06F17/30 主分类号 G06F17/30
代理机构 代理人
主权项
地址