Preprint
Sep 2026
Sub-polynomial parameterized complexity of $k$-core
Alternative parameterizations of the k-core problem are investigated to identify conditions under which it can be placed into sub-polynomial complexity classes, and the boundary of parallel tractability for the k-core problem is explored.
Y. S. To, Cristina G. Fernandes
· 0 citations