Computing roots of directed graphs is graph isomorphism hard
  The k-th power D^k of a directed graph D is defined to be the directed graph on the vertices of D with an arc from a to b in D^k iff one can get from a to b in D with exactly k steps. This notion is equivalent to the k-fold composition of binary relations or k-th powers of Boolean matrices.   A k-th root of a directed graph D is another directed graph R with R^k = D. We show that for each k >= 2, computing a k-th root of a directed graph is at least as hard as the graph isomorphism problem. 
Martin Kutz