# Finding even cycle in directed graphs

Given a directed graph, we want to decide whether it contains a directed cycle of even length. This 1997 paper by YUSTER and ZWICK states that the problem is not known to be in $P$ nor is it known to be $NP$-complete.

Is there any recent result that resolves the complexity of the even cycle problem in directed graphs?