Peer To Patent

View Prior Art for Claim 00009

The method of Claim 7, wherein said performing said forward processing steps further includes:ordering a plurality of nodes of said graph in a priority queue Q; and

while said Q is not empty, obtaining said u as a next top node in said Q and stopping said forward processing steps if an upper bound of an aggregate score of said u is less than or equal to said lower bound of said aggregate scores of said k nodes, wherein said u, said v, said subset of nodes of said graph, said neighboring nodes within h-hops of said v, and said neighboring nodes within h-hops of said u are included in said plurality of nodes.