Converting unordered graphs to oblivious read once ordered graph representation
First Claim
1. An article comprising a tangible machine-readable storage medium embodying instructions that when performed by one or more machines result in operations comprising:
- receiving data characterizing a desired variable order and an unordered graph;
enumerating all paths in the unordered graph;
leveling, in an oblivious read once decision graph, a first path in the unordered graph according to the desired variable order; and
for each additional path in the unordered graph other than the first path, leveling the additional path in the desired order, adding nodes of the additional path to the oblivious read once decision graph, and performing a union operation on the oblivious read once decision graph to union graph roots on the oblivious read once decision graph.
1 Assignment
0 Petitions
Accused Products
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.
-
Citations
22 Claims
-
1. An article comprising a tangible machine-readable storage medium embodying instructions that when performed by one or more machines result in operations comprising:
-
receiving data characterizing a desired variable order and an unordered graph; enumerating all paths in the unordered graph; leveling, in an oblivious read once decision graph, a first path in the unordered graph according to the desired variable order; and for each additional path in the unordered graph other than the first path, leveling the additional path in the desired order, adding nodes of the additional path to the oblivious read once decision graph, and performing a union operation on the oblivious read once decision graph to union graph roots on the oblivious read once decision graph. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10)
-
-
11. A computer-implemented method comprising:
-
receiving data characterizing a desired variable order and an unordered graph; enumerating all paths in the unordered graph; leveling, in an oblivious read once decision graph, a first path in the unordered graph according to the desired variable order; and for each additional path in the unordered graph other than the first path, leveling the additional path in the desired order, adding nodes of the additional path to the oblivious read once decision graph, and performing a union operation on the oblivious read once decision graph to union graph roots on the oblivious read once decision graph. - View Dependent Claims (12, 13, 14, 15, 16, 17, 18, 19, 20)
-
-
21. An article comprising a non-transitory machine-readable storage medium embodying instructions that when performed by one or more machines result in operations comprising:
-
receiving data characterizing a desired variable order and an unordered graph; enumerating all paths in the unordered graph; and recursively leveling, for an oblivious read once decision graph, each enumerated path according to the desired variable order. - View Dependent Claims (22)
-
Specification