Fast and scalable connected component computation
US10157429B2 · kind B2 · utility
0Cited by
0References
11Claims
0Family size
Assignee
Inventors
Key dates
| Filing date | Mar 19, 2015 |
| Grant date | Dec 18, 2018 |
| Priority date | — |
| Expiry date | Sep 3, 2036 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06Q50/01
- WIPO fieldIT methods for management
- WIPO sectorElectrical engineering
Abstract
Finding connected components in a graph is a well-known problem in a wide variety of application areas such as social network analysis, data mining, image processing, and etc. We present an efficient and scalable approach to find all the connected components in a given graph. We compare our approach with the state-of-the-art on a real-world graph. We also demonstrate the viability of our approach on a massive graph with ˜6B nodes and ˜92B edges on an 80-node Hadoop cluster. To the best of our knowledge, this is the largest graph publicly used in such an experiment.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.