Abstract

Szwarcfiter and Lauer have published one of the most efficient known algorithms for enumerating the cycles of a digraph. An improved version of this algorithm together with a new strategy for preprocessing the digraph, in order to simplify the cycle enumeration process, is presented.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call