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

Given a temporal network , (where and ) is said to be a \mbox{-}clique of , if for every pair of vertices in , there must exist at least links in each duration within the time interval . Enumerating such maximal cliques is an important problem in temporal network analysis, as it reveals contact pattern among the nodes of . In this paper, we study the maximal \mbox{-}clique enumeration problem in online setting; i.e.; the entire link set of the network is not known in advance, and the links are coming as a batch in an iterative manner. Suppose, the link set till time stamp (i.e., ), and its corresponding -clique set are known. In the next batch (till time ), a new set of links (denoted as ) is arrived.