On finding the strongly connected components in a directed graph
Authors:
- Esko NuutilaENEsko Nuutila
- Eljas Soisalon-SoininenESEljas Soisalon-Soininen
- 1 January 1994
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 49 (1) , 9-14
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- I/O- and CPU-optimal recognition of strongly connected componentsInformation Processing Letters, 1993
- An improved transitive closure algorithmComputing, 1983
- A strong-connectivity algorithm and its applications in data flow analysisComputers & Mathematics with Applications, 1981
- On computing the transitive closure of a relationActa Informatica, 1977
- Depth-First Search and Linear Graph AlgorithmsSIAM Journal on Computing, 1972