Banerjee, SumanPal, BithikaBanerjee, SumanSumanBanerjeePal, BithikaBithikaPal2025-08-282025-08-282020-04-01https://arxiv.org/abs/2004.05935https://repository.iitgn.ac.in/handle/IITG2025/19774A \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 typically represented as a collection of triplets of the form that denotes the interaction between the agents and at time . For analyzing the contact patterns of the agents forming a temporal network, recently the notion of classical \textit{clique} of a \textit{static graph} has been generalized as \textit{\mbox{-}Clique} of a Temporal Network. In the same direction, one of our previous studies introduces the notion of \textit{\mbox{-}Clique}, which is basically a \textit{vertex set}, \textit{time interval} pair, in which every pair of the clique vertices are linked at least times in every duration of the time interval. In this paper, we propose a different methodology for enumerating all the maximal \mbox{-}Cliques of a given temporal network. The proposed methodology is broadly divided into two phases. In the first phase, each temporal link is processed for constructing \mbox{-}Clique(s) with maximum duration. In the second phase, these initial cliques are expanded by vertex addition to form the maximal cliques. From the experimentation carried out on real\mbox{-}world temporal network datasets, we observe that the proposed methodology enumerates all the maximal \mbox{-}Cliques efficiently, particularly when the dataset is sparse. As a special case (), the proposed methodology is also able to enumerate \mbox{-}cliques with much less time compared to the existing methods.en-USe-Print123456789/435