Faster maximal clique enumeration in large real-world link streams
From MaRDI portal
Publication:6616227
DOI10.7155/jgaa.v28i1.2932zbMath1548.05169MaRDI QIDQ6616227
Alexis Baudin, Clémence Magnien, Lionel Tabourier
Publication date: 8 October 2024
Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)
dynamic networktemporal graphmaximal clique enumerationlink streamBron-Kerboschoutput-sensitive complexity
This page was built for publication: Faster maximal clique enumeration in large real-world link streams