20 citations · 20 across the 2 of their papers we have counts for
2 papers
cs.DS2021
Efficient Reporting of Top-k Subset Sums
Biswajit Sanyal, Subhashis Majumder, Priya Ranjan Sinha Mahapatra
The "Subset Sum problem" is a very well-known NP-complete problem. In this work, a top-k variation of the "Subset Sum problem" is considered. This problem has wide application in r…
cs.SI2017★ 20 cited
Fast Detection of Community Structures using Graph Traversal in Social Networks
Partha Basuchowdhuri, Satyaki Sikdar, Varsha Nagarajan +3
Finding community structures in social networks is considered to be a challenging task as many of the proposed algorithms are computationally expensive and does not scale well for…