On a cycle finding algorithm

DOI10.1016/0020-0190(80)90030-7MaRDI QIDQ1144940zbMATH OpenOpenAlexFDO

Authors 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

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

Cites work

• scientific article; zbMATH DE number 3449757 (Why is no real title available?)
• scientific article; zbMATH DE number 3226832 (Why is no real title available?)
• A search strategy for the elementary cycles of a directed graph
• Bounds on Backtrack Algorithms for Listing Cycles, Paths, and Spanning Trees
• Cycle detection in critical path networks
• Depth-First Search and Linear Graph Algorithms
• Finding All the Elementary Circuits of a Directed Graph

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1144940)