Cycle detection in critical path networks

DOI10.1016/0020-0190(78)90031-5MaRDI QIDQ1249558zbMATH OpenOpenAlexFDO

Authors Andreas Karayiannis, Georghios Loizou

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

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

Cites work

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

Cited in

(2)

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

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

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