11 citations · 25 across the 27 of their papers we have counts for
4 papers · 1 filter
Structural Parameterizations of Budgeted Graph Coloring
Susobhan Bandopadhyay, Suman Banerjee, Aritra Banik +1
We introduce a variant of the graph coloring problem, which we denote as {\sc Budgeted Coloring Problem} (\bcp). Given a graph , an integer and an ordered list of integers $…
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…
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…