A faster algorithm for the
k
-forest problem: breaking the
O
k
(
n
3/2
) complexity barrier
Pavel Arkhipov,
Vladimir Kolmogorov
arXiv technical report, September 2024.
Links
arXiv