Cycle detection in critical path networks

DOI10.1016/0020-0190(78)90031-5zbMath0385.94029OpenAlexW2094937608MaRDI QIDQ1249558

Georghios Loizou, Andreas Karayiannis

Publication date: 1978

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

Full work available at URL: https://doi.org/10.1016/0020-0190(78)90031-5

Mathematics Subject Classification ID

Applications of graph theory to circuits and networks (94C15) Directed graphs (digraphs), tournaments (05C20) Software, source code, etc. for problems pertaining to combinatorics (05-04) Software, source code, etc. for problems pertaining to information and communication theory (94-04)

Related Items (2)

Depth-first K-trees and critical path analysis ⋮ On a cycle finding algorithm

Cites Work

• On the computational power of pushdown automata
• Bounds on Backtrack Algorithms for Listing Cycles, Paths, and Spanning Trees
• A search strategy for the elementary cycles of a directed graph
• On Algorithms for Enumerating All Circuits of a Graph
• Finding All the Elementary Circuits of a Directed Graph
• Depth-First Search and Linear Graph Algorithms

This page was built for publication: Cycle detection in critical path networks