Papers
Topics
Authors
Recent
Search
2000 character limit reached

Tight bounds and output sensitive algorithms for maximal clique enumeration in link streams

Published 8 Oct 2026 in cs.DS | (2610.11385v1)

Abstract: A link stream is a set of interactions between pairs of vertices, each one lasting during some time interval, and a clique of a link stream is a set of vertices together with a time interval during which all of them interact. A clique is maximal if neither its vertex set nor its interval can be enlarged. All known algorithms listing the maximal cliques of a link stream may spend time exponential in the size of a clique for each clique they output. Here, we approach the question under the light of two parameters of the instantaneous graphs of the stream, their maximum degree ΔΔ and their degeneracy kk. We prove that a link stream with mm links has O(mΔ23Δ/3)O(mΔ^2 3^{Δ/3}) maximal cliques, and that a link stream with nn vertices and ∣T∣|\mathcal{T}| distinct end times has O(n∣T∣k23k/3)O(n|\mathcal{T}|k^2 3^{k/3}) maximal cliques. Both bounds are tight up to a factor polynomial in ΔΔ and kk respectively, and the second one improves the factor 2k2^k of previous bounds to 3k/33^{k/3}. Then we present two algorithms. The first one has setup time O(mlog⁡m)O(m\log m) and polynomial time delay poly(Δ)log⁡m\mathrm{poly}(Δ)\log m. The second one has setup time O(mlog⁡m+mk2log⁡3n)O(m\log m+mk^2\log^3 n) and polynomial time delay poly(k)log⁡m\mathrm{poly}(k)\log m. To the best of our knowledge, these are the first algorithms with polynomial time delay for this problem. We also give an online version of the second algorithm, and we show that our results apply to the ΔΔ-cliques and (Δ,γ)(Δ,γ)-cliques of temporal graphs.

Authors (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.