Open access
Sep 2026
A Note on Directed Clique Token Sliding
It is shown that the problem is PSPACE -complete on oriented graphs, NP -complete on directed acyclic graphs (DAGs), and W -hard on DAGs when parameterized by k, and the NP -completeness of the bounded-length variant on DAGs is proved.
Duc A. Hoang
· Discrete Mathematics Letters · 0 citations