LOWER BOUNDS FOR THE CYCLE DETECTION PROBLEMFICH FE.1981; ANNUAL ASSOCIATION FOR COMPUTING MACHINERY SYMPOSIUM ON THEORY OF COMPUTING. 13/1981/MILWAUKEE WI; USA; NEW YORK: ASSOCIATION FOR COMPUTING MACHINERY; DA. 1981; PP. 96-105; BIBL. 4 REF.Conference Paper

LOGIC CIRCUIT FOR CYCLE DETECTION IN A STATE DIAGRAM.WAXMAN J; ROOTENBERG J.1977; I.E.E.E. TRANS. COMPUTERS; U.S.A.; DA. 1977; VOL. 26; NO 3; PP. 303-305; BIBL. 2 REF.Article

Improved lower bounds for the cycle detection problemALLENDER, E; KLAWE, M. M.Theoretical computer science. 1985, Vol 36, Num 2-3, pp 231-237, issn 0304-3975Article

Is there a best symbolic cycle-detection algorithm?FISLER, Kathi; FRAER, Ranan; KAMHI, Gila et al.Lecture notes in computer science. 2001, pp 420-434, issn 0302-9743, isbn 3-540-41865-2Conference Paper

Negative-cycle detection algorithmsCHERKASSKY, B. V; GOLDBERG, A. V.Mathematical programming. 1999, Vol 85, Num 2, pp 277-311, issn 0025-5610Article