2 citations · 9 across the 13 of their papers we have counts for
Showing 2024Show all
2 papers · 1 filter
cs.DM2024★ 1 cited
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…
cs.DM2024★ 1 cited
On shortest products for nonnegative matrix mortality
Andrew Ryzhikov
Given a finite set of matrices with integer entries, the matrix mortality problem asks if there exists a product of these matrices equal to the zero matrix. We consider a special c…