I know that the 3-cycle cover decision problem for directed graphs (3-DCC), defined as finding whether a directed graph has a disjoint vertex cycle cover in which every cycle has at least 3 edges, is NP-complete.
Does anyone know what is the actual scaling of the best known algorithm to solve that problem? And, most importantly, what graphs can be tackled with that algorithm?
e.g., I have a graph with 2000 vertices and 2500 edges. Is this solvable? Do I need a supercomputer? What are the limits?
