82 citations · 195 across the 17 of their papers we have counts for
7 papers · 1 filter
Neighborhood-based Hypergraph Core Decomposition
Naheed Anjum Arafat, Arijit Khan, Arpit Kumar Rai +1
We propose neighborhood-based core decomposition: a novel way of decomposing hypergraphs into hierarchical neighborhood-cohesive subhypergraphs. Alternative approaches to decomposi…
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…
Maximizing Contrasting Opinions in Signed Social Networks
Kaivalya Rawal, Arijit Khan
The classic influence maximization problem finds a limited number of influential seed users in a social network such that the expected number of influenced users in the network, fo…
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…
Fast Influence Maximization in Dynamic Graphs: A Local Updating Approach
Vijaya Krishna Yalavarthi, Arijit Khan
We propose a generalized framework for influence maximization in large-scale, time evolving networks. Many real-life influence graphs such as social networks, telephone networks, a…
Conditional Reliability in Uncertain Graphs
Arijit Khan, Francesco Bonchi, Francesco Gullo +1
Network reliability is a well-studied problem that requires to measure the probability that a target node is reachable from a source node in a probabilistic (or uncertain) graph, i…