Bithika Pal

activity

20182021

collaborators

Showing cs.DSShow 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.DS2018

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…

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

On the Enumeration of Maximal (Δ,γ)-Cliques of a Temporal Network

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

On the Enumeration of Maximal $(Δ, γ)$ -Cliques of a Temporal Network