A simplified correctness proof for a well-known algorithm computing strongly connected components.

DOI10.1016/S0020-0190(01)00306-4zbMath1043.68110MaRDI QIDQ1853027

Ingo Wegener

Publication date: 21 January 2003

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

zbMATH Keywords

AlgorithmsDepth first searchGraph problemsStrongly connected components

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

Unnamed Item

Cites Work

• On the computational power of pushdown automata
• Depth-First Search and Linear Graph Algorithms
• Time and tape complexity of pushdown automaton languages
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item