Parallel Algorithms for Densest Subgraph Discovery Using Shared Memory Model

B. D. M. De Zoysa, Y. A. M. M. A. Ali, M. D. I. Maduranga +3

The problem of finding dense components of a graph is a widely explored area in data analysis, with diverse applications in fields and branches of study including community mining,…