On finding the strongly connected components in a directed graph
type: Item
instance of: scholarly article
title: On finding the strongly connected components in a directed graph
zbMATH Open document ID: 0787.68082
DOI: 10.1016/0020-0190(94)90047-7
author: Esko Nuutila
author: Eljas Soisalon-Soininen
published in: Information Processing Letters
publication date: 1994-02-24T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 500507
zbMATH Keywords: Tarjan's algorithm
zbMATH Keywords: strongly connected components
zbMATH Keywords: transitive closure
Wikidata QID: Q57310094
MaRDI profile type: Publication
full work available at URL: 0020-0190(94)90047-7
OpenAlex ID: W2084063516
cites work: Q4065051
cites work: On computing the transitive closure of a relation
cites work: I/O- and CPU-optimal recognition of strongly connected components
cites work: An improved transitive closure algorithm
cites work: A strong-connectivity algorithm and its applications in data flow analysis
cites work: Depth-First Search and Linear Graph Algorithms
DBLP publication ID: journals/ipl/NuutilaS94
description: scientific article; zbMATH DE number 500507