@article{b54ebf2371ef4bbba581288b7954a7ec,
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 = "10.1016/j.ejc.2023.103815",
language = "אנגלית",
volume = "119",
journal = "European Journal of Combinatorics",
issn = "0195-6698",
publisher = "Academic Press",
}