On finding the strongly connected components in a directed graph (Q1313703)
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: On finding the strongly connected components in a directed graph |
scientific article; zbMATH DE number 500507
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On finding the strongly connected components in a directed graph |
scientific article; zbMATH DE number 500507 |
Statements
On finding the strongly connected components in a directed graph (English)
0 references
24 February 1994
0 references
Tarjan's algorithm
0 references
strongly connected components
0 references
transitive closure
0 references
