Theoretically and practically efficient parallel nucleus decomposition
<jats:p> This paper studies the nucleus decomposition problem, which has been shown to be useful in finding dense substructures in graphs. We present a novel parallel algorithm that is efficient both in theory and in practice. Our algorithm achieves a work complexity matching the best sequenti...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
VLDB Endowment,
2022-07-20T14:40:08Z.
|
| Subjects: | |
| Online Access: | Get fulltext |