A new algorithm for finding weak components

DOI10.1016/0020-0190(74)90040-4zbMath0297.68029OpenAlexW1979958727MaRDI QIDQ1214260

Robert Endre Tarjan

Publication date: 1974

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

Full work available at URL: https://doi.org/10.1016/0020-0190(74)90040-4

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Algorithms in computer science (68W99) Software, source code, etc. for problems pertaining to combinatorics (05-04)

Related Items

Edge-disjoint spanning trees and depth-first search

Cites Work

• Finding Dominators in Directed Graphs
• Computing the Weak Components of a Directed Graph
• Depth-First Search and Linear Graph Algorithms
• Unnamed Item