Directed graph compression
US10579679B2 · kind B2 · utility
0Cited by
4References
10Claims
0Family size
Assignee
Inventors
Key dates
| Filing date | Dec 1, 2017 |
| Grant date | Mar 3, 2020 |
| Priority date | — |
| Expiry date | Dec 1, 2037 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F17/10
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
In one embodiment of the present disclosure, an original graph including nodes is obtained. The nodes of the original graph are reordered to generate a reordered graph. Non-zero elements in an adjacency matrix for the reordered graph are clustered as compared with an adjacency matrix for the original graph. The adjacency matrix for the reordered graph is encoded with integers. The integers correspond to non-empty blocks in the adjacency matrix for the reordered graph.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.