A simplified correctness proof for a well-known algorithm computing strongly connected components.
type: Item
instance of: scholarly article
title: A simplified correctness proof for a well-known algorithm computing strongly connected components.
zbMATH Open document ID: 1043.68110
DOI: 10.1016/S0020-0190(01)00306-4
author: Ingo Wegener
published in: Information Processing Letters
publication date: 2003-01-21T00:00:00Z
Mathematics Subject Classification ID: 68W05
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 1856373
zbMATH Keywords: Algorithms
zbMATH Keywords: Depth first search
zbMATH Keywords: Graph problems
zbMATH Keywords: Strongly connected components
MaRDI profile type: Publication
cites work: On the computational power of pushdown automata
cites work: Time and tape complexity of pushdown automaton languages
cites work: Q3619797
cites work: Q4024058
cites work: Q3998976
cites work: Q3219752
cites work: Q4894115
cites work: Q4144192
cites work: Q3311639
cites work: Depth-First Search and Linear Graph Algorithms
description: scientific article; zbMATH DE number 1856373