mlsanityData to 14 Oct 2026

Finding Strong Components Using Depth-First Search

arXiv 2201.07197 ↗First posted 18 Jan 2022cs.DScited by 1

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). First posted on arXiv 18 Jan 2022.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 1.

1 paper.

  1. 2026ICBAC: an Intelligent Contract-Based Access Control framework for supply chain management by integrating blockchain and federated learningcited by 0