A simplified correctness proof for a well-known algorithm computing strongly connected components. (Q1853027)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A simplified correctness proof for a well-known algorithm computing strongly connected components. |
scientific article; zbMATH DE number 1856373
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A simplified correctness proof for a well-known algorithm computing strongly connected components. |
scientific article; zbMATH DE number 1856373 |
Statements
A simplified correctness proof for a well-known algorithm computing strongly connected components. (English)
0 references
21 January 2003
0 references
Algorithms
0 references
Depth first search
0 references
Graph problems
0 references
Strongly connected components
0 references
