Simplification of large networks and graphs
US10042958B2 · kind B2 · utility
12Cited by
0References
5Claims
0Family size
Assignee
Inventors
Key dates
| Filing date | Sep 12, 2013 |
| Grant date | Aug 7, 2018 |
| Priority date | — |
| Expiry date | Oct 14, 2035 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F16/9027
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
Embodiments relate to simplifying large and complex networks and graphs using global connectivity information based on calculated node centralities. An aspect includes calculating node centralities of a graph until a designated number of central nodes are detected. A percentage of the central nodes are then selected as pivot nodes. The neighboring nodes to each of the pivot nodes are then collapsed until the graph shrinks to a predefined threshold of total nodes. Responsive to the number of total nodes reaching the predefined threshold, the simplified graph is outputted.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.