6 papers
Budgeted Influence and Earned Benefit Maximization with Tags in Social Networks
Suman Banerjee, Bithika Pal
Given a social network, where each user is associated with a selection cost, the problem of \textsc{Budgeted Influence Maximization} (\emph{BIM Problem} in short) asks to choose a…
An Efficient Updation Approach for Enumerating Maximal \mbox{-}Cliques of a Temporal Network
Suman Banerjee, Bithika Pal
Given a temporal network , (where and $[t_a,t_b] \sub…
First Stretch then Shrink and Bulk: A Two Phase Approach for Enumeration of Maximal \mbox{-}Cliques of a Temporal Network
Suman Banerjee, Bithika Pal
A \emph{Temporal Network} (also known as \emph{Link Stream} or \emph{Time-Varying Graph}) is often used to model a time-varying relationship among a group of agents. It is typicall…
DySky: Dynamic Skyline Queries on Uncertain Graphs
Suman Banerjee, Bithika Pal
Given a graph, and a set of query vertices (subset of the vertices), the dynamic skyline query problem returns a subset of data vertices (other than query vertices) which are not d…
Threshold-Based Heuristics for Trust Inference in a Social Network
Bithika Pal, Suman Banerjee, Mamata Jenamani
Trust among the users of a social network plays a pivotal role in item recommendation, particularly for the cold start users. Due to the sparse nature of these networks, trust info…
On the Enumeration of Maximal -Cliques of a Temporal Network
Suman Banerjee, Bithika Pal
A temporal network is a mathematical way of precisely representing a time varying relationship among a group of agents. In this paper, we introduce the notion of -Cliques o…