Finding strong components using depth-first search

Robert E. Tarjan; Uri Zwick

doi:https://doi.org/10.1016/j.ejc.2023.103815

Finding strong components using depth-first search

Robert E. Tarjan, Uri Zwick

School of Computer Science

Tel Aviv University

Research output: Contribution to journal › Article › peer-review

Abstract

We survey three algorithms that use depth-first search to find the strong components of a directed graph in linear time: (1) Tarjan's algorithm; (2) a cycle-finding algorithm; and (3) a bidirectional search algorithm.

Original language	English
Article number	103815
Journal	European Journal of Combinatorics
Volume	119
DOIs	https://doi.org/10.1016/j.ejc.2023.103815
State	Published - Jun 2024

All Science Journal Classification (ASJC) codes

Discrete Mathematics and Combinatorics

Access to Document

https://doi.org/10.1016/j.ejc.2023.103815

Cite this

@article{803d3a86231e4485bdb3928bdf6a691b,

title = "Finding strong components using depth-first search",

abstract = "We survey three algorithms that use depth-first search to find the strong components of a directed graph in linear time: (1) Tarjan's algorithm; (2) a cycle-finding algorithm; and (3) a bidirectional search algorithm.",

author = "Tarjan, {Robert E.} and Uri Zwick",

note = "Publisher Copyright: {\textcopyright} 2023 Elsevier Ltd",

year = "2024",

month = jun,

doi = "https://doi.org/10.1016/j.ejc.2023.103815",

language = "الإنجليزيّة",

volume = "119",

journal = "European Journal of Combinatorics",

issn = "0195-6698",

publisher = "Academic Press Inc.",

}

TY - JOUR

T1 - Finding strong components using depth-first search

AU - Tarjan, Robert E.

AU - Zwick, Uri

PY - 2024/6

Y1 - 2024/6

N2 - We survey three algorithms that use depth-first search to find the strong components of a directed graph in linear time: (1) Tarjan's algorithm; (2) a cycle-finding algorithm; and (3) a bidirectional search algorithm.

AB - We survey three algorithms that use depth-first search to find the strong components of a directed graph in linear time: (1) Tarjan's algorithm; (2) a cycle-finding algorithm; and (3) a bidirectional search algorithm.

UR - http://www.scopus.com/inward/record.url?scp=85176096442&partnerID=8YFLogxK

U2 - https://doi.org/10.1016/j.ejc.2023.103815

DO - https://doi.org/10.1016/j.ejc.2023.103815

M3 - مقالة

SN - 0195-6698

VL - 119

JO - European Journal of Combinatorics

JF - European Journal of Combinatorics

M1 - 103815

ER -

Finding strong components using depth-first search

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this