I/O- and CPU-optimal recognition of strongly connected components

DOI10.1016/0020-0190(93)90011-WzbMath0768.68149OpenAlexW2062626787MaRDI QIDQ1209333

Bin Jiang

Publication date: 16 May 1993

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(93)90011-w

zbMATH Keywords

optimal algorithmstrongly connected componentsdepth- first searchgraph traverser

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Related Items (4)

Symbolic coloured SCC decomposition ⋮ Unnamed Item ⋮ On finding the strongly connected components in a directed graph ⋮ Efficient computation of Lyapunov functions for Morse decompositions

Cites Work

• Traversing graphs in a paging environment, BFS or DFS?
• Depth-First Search and Linear Graph Algorithms
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: I/O- and CPU-optimal recognition of strongly connected components