Fast component enumeration in graphs with implicit edges
US9916393B2 · kind B2 · utility
Assignee
Inventor
Key dates
| Filing date | Jun 2, 2015 |
| Grant date | Mar 13, 2018 |
| Priority date | — |
| Expiry date | Jun 24, 2035 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06T11/203
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
A method and system for graphical enumeration. The method includes creating an ordered set of vertices for a graph such that each vertex is associated with a corresponding index, and wherein each vertex in the ordered set of vertices includes information. A plurality of keys is created for defining the information. A plurality of lists of vertices is created, each of which is associated with a corresponding key such that vertices in a corresponding list include information associated with the corresponding key. For a first list of vertices, a least valued index is determined from a group of associated vertices based on vertices in the first list and vertices pointed to by the vertices in the first list. Also, all associated vertices are pointed to a root vertex associated with the least valued index.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.