On the Enumeration of Maximal $(\Delta, \gamma)$-Cliques of a Temporal Network

29 Apr 2018 Banerjee Suman Pal Bithika

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 $(\Delta, \gamma)$-Cliques of a temporal network, where every pair of vertices present in the clique communicates atleast $\gamma$ times in each $\Delta$ period within a given time duration... (read more)

PDF Abstract
No code implementations yet. Submit your code now

Categories


  • DATA STRUCTURES AND ALGORITHMS