An efficient updation approach for enumerating maximal (Δ,γ)-cliques of a temporal network

DOI10.1093/comnet/cnac027zbMath1506.68063OpenAlexW3046840501MaRDI QIDQ5881458

Suman Banerjee, Unnamed Author

Publication date: 10 March 2023

Published in: Journal of Complex Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/comnet/cnac027

zbMATH Keywords

temporal networkupdating algorithmlink streamonline setting\( \Delta \)-clique\(( \Delta, \gamma )\)-clique

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Enumeration in graph theory (05C30) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Online algorithms; streaming algorithms (68W27)

This page was built for publication: An efficient updation approach for enumerating maximal (Δ,γ)-cliques of a temporal network