Converting unordered graphs to oblivious read once ordered graph representation
US8280836B2 · kind B2 · utility
Assignee
Inventor
Key dates
| Filing date | Sep 8, 2008 |
| Grant date | Oct 2, 2012 |
| Priority date | — |
| Expiry date | Sep 1, 2030 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06N5/02
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
Data characterizing a desired variable order and an unordered graph can be received so that all paths in the unordered graph can be enumerated and a first path in the unordered graph can be leveled according to the desired variable order in a first oblivious read once decision graph. For each additional path other than the first path, the additional path is leveled in the desired order, nodes of the additional path are added to the first oblivious read once decision graph, and a union operation is performed on the first oblivious read once decision graph to union graph roots on the first oblivious read once decision graph. Thereafter, generation of a second oblivious read once decision graph can be initiated after completing processing of the first path and each additional path. Related apparatus, systems, techniques and articles are also described.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.