Search Results for author: B. D. M. De Zoysa

Found 1 papers, 0 papers with code

Parallel Algorithms for Densest Subgraph Discovery Using Shared Memory Model

no code implementations27 Feb 2021 B. D. M. De Zoysa, Y. A. M. M. A. Ali, M. D. I. Maduranga, Indika Perera, Saliya Ekanayake, Anil Vullikanti

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, spam detection, computer security and bioinformatics.

Computer Security Spam detection

Cannot find the paper you are looking for? You can Submit a new open access paper.