On a cycle finding algorithm

DOI10.1016/0020-0190(80)90030-7zbMath0444.68056OpenAlexW2059645406MaRDI QIDQ1144940

Georghios Loizou

Publication date: 1980

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(80)90030-7

zbMATH Keywords

cycle finding algorithmSyslo's algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20) Software, source code, etc. for problems pertaining to computer science (68-04) Software, source code, etc. for problems pertaining to combinatorics (05-04)

Cites Work

• Cycle detection in critical path networks
• Bounds on Backtrack Algorithms for Listing Cycles, Paths, and Spanning Trees
• A search strategy for the elementary cycles of a directed graph
• Finding All the Elementary Circuits of a Directed Graph
• Depth-First Search and Linear Graph Algorithms
• Unnamed Item
• Unnamed Item

This page was built for publication: On a cycle finding algorithm