Polynomial-space enumeration with polynomial delay
Determine whether maximal cliques in link streams can be enumerated with time delay polynomial in the degeneracy parameter k and logarithmic in the number of links m while using only space polynomial in the input size.
References
We ask whether there is an algorithm with time delay polynomial in $k$ and logarithmic in $m$ which only requires space polynomial in the input. A similar question was asked for static graphs in , and it is still open.
We ask whether the maximal cliques of a link stream can be enumerated with time delay depending only on $k$, after a setup phase polynomial in the input.
We ask whether such an orientation can be maintained, and whether it yields an online algorithm whose time per event is polynomial in $k$ and polylogarithmic in $n$, besides the time spent to output the maximal cliques.
We ask whether they can be listed with polynomial time delay, or even in output polynomial time, in link streams in which a pair may interact several times.