Bithika Pal

activity

20182021

collaborators

Showing 2020Show all

3 papers · 1 filter

cs.DS2020

An Efficient Updation Approach for Enumerating Maximal $(Δ, γ)$ \mbox{-}Cliques of a Temporal Network

Suman Banerjee, Bithika Pal

Given a temporal network $G (V, E, T)$ , $(X, [t_{a}, t_{b}])$ (where $X \subseteq V (G)$ and $[t_a,t_b] \sub…

cs.DS2020

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…

cs.DB2020

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…

An Efficient Updation Approach for Enumerating Maximal (Δ,γ)\mbox{-}Cliques of a Temporal Network

First Stretch then Shrink and Bulk: A Two Phase Approach for Enumeration of Maximal (Δ,γ)\mbox{-}Cliques of a Temporal Network

DySky: Dynamic Skyline Queries on Uncertain Graphs

An Efficient Updation Approach for Enumerating Maximal $(Δ, γ)$ \mbox{-}Cliques of a Temporal Network

First Stretch then Shrink and Bulk: A Two Phase Approach for Enumeration of Maximal $(Δ, γ)$ \mbox{-}Cliques of a Temporal Network