Ranking nodes in a graph
US8681155B2 · kind B2 · utility
9Cited by
8References
13Claims
0Family size
Assignee
Inventor
Key dates
| Filing date | Aug 13, 2012 |
| Grant date | Mar 25, 2014 |
| Priority date | — |
| Expiry date | Dec 7, 2032 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06T11/20
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
Techniques for ranking nodes in a graph are provided. The techniques include computing resultant path strength between each pair of nodes in a polynomial time, determining a first node based on resultant path strength such that total path strength to the first node is a maximum value, iteratively determining a next node from the first node to which the resultant path strength is a maximum value and the node is not visited, and providing each determined node a unique rank value, and ranking the nodes in an order determined by the unique rank value of each node.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.