82 citations · 195 across the 17 of their papers we have counts for
3 papers · 1 filter
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…
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…
Aggregate Queries on Knowledge Graphs: Fast Approximation with Semantic-aware Sampling
Yuxiang Wang, Arijit Khan, Xiaoliang Xu +3
A knowledge graph (KG) manages large-scale and real-world facts as a big graph in a schema-flexible manner. Aggregate query is a fundamental query over KGs, e.g., "what is the aver…