The complexity of computing the period and the exponent of a digraph

Stefan Kiefer, Andrew Ryzhikov

The period of a strongly connected digraph is the greatest common divisor of the lengths of all its cycles. The period of a digraph is the least common multiple of the periods of i…