3 citations · 3 across the 2 of their papers we have counts for
3 papers
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…
cs.SI2019★ 3 cited
An In-Depth Comparison of s-t Reliability Algorithms over Uncertain Graphs
Xiangyu Ke, Arijit Khan, Leroy Lim Hong Quan
Uncertain, or probabilistic, graphs have been increasingly used to represent noisy linked data in many emerging applications, and have recently attracted the attention of the datab…
cs.DB2019
Reliability Maximization in Uncertain Graphs
Xiangyu Ke, Arijit Khan, Mohammad Al Hasan +1
Network reliability measures the probability that a target node is reachable from a source node in an uncertain graph, i.e., a graph where every edge is associated with a probabili…