A linear-time algorithm for finding all feedback vertices
From MaRDI portal
Publication:1250830
DOI10.1016/0020-0190(78)90015-7zbMath0389.05038OpenAlexW2081123373MaRDI QIDQ1250830
Michael R. Garey, Robert Endre Tarjan
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)90015-7
Analysis of algorithms and problem complexity (68Q25) Extremal problems in graph theory (05C35) Directed graphs (digraphs), tournaments (05C20) Algorithms in computer science (68W99) Software, source code, etc. for problems pertaining to combinatorics (05-04)
Related Items
Efficient parallel algorithms for path problems in directed graphs ⋮ On the graph traversal method for evaluating linear binary-chain programs ⋮ Deriving fold/unfold transformations of logic programs using extended OLDT-based abstract interpretation
Cites Work
This page was built for publication: A linear-time algorithm for finding all feedback vertices