All Questions

This is a followup to my question How does the complexity of calculating the Permanent imply the NP completeness of directed 3-cycle cover? Question: who contributed problem [GT13] PARTITION INTO ...

A directed cycle-cover of a digraph $D$ is in the sense of this post equivalent to a perfect matching in the related undirected biadjacency graph $B$ in which the edges connect a vertex $u$ of $D$ in ...