24 citations · 51 across the 12 of their papers we have counts for
Showing 2022Show all
3 papers · 1 filter
cs.SI2022
Most Probable Densest Subgraphs
Arkaprava Saha, Xiangyu Ke, Arijit Khan +1
Computing the densest subgraph is a primitive graph operation with critical applications in detecting communities, events, and anomalies in biological, social, Web, and financial n…
cs.DB2022
Random Walk-based Community Key-members Search over Large Graphs
Yuxiang Wang, Yuyang Zhao, Xiaoliang Xu +3
Given a graph , a query node , and an integer , community search (CS) seeks a cohesive subgraph (measured by community models such as -core or -truss) from that…
cs.SI2022
Voting-based Opinion Maximization
Arkaprava Saha, Xiangyu Ke, Arijit Khan +1
We investigate the novel problem of voting-based opinion maximization in a social network: Find a given number of seed nodes for a target campaigner, in the presence of other compe…