Tarjan: depth-first search and linear graph algorithms

What changed

Derived linear-time strongly connected and biconnected component algorithms using DFS.

Scientific scope

The record is Tarjan's sole-author 1972 SIAM Journal on Computing paper. It concerns the two graph problems and complexity bounds proved there and does not absorb all later DFS algorithms or graph decompositions.

Evidence

The linked sources identify this contribution and its scope. WRS has not independently reconstructed the scientific claims. The record is Tarjan's sole-author 1972 SIAM Journal on Computing paper. It concerns the two graph problems and complexity bounds proved there and does not absorb all later DFS algorithms or graph decompositions.

Contributors

• Robert E. Tarjan · SCIENCE: Named source author of the scoped work; individual effort shares are not measured.

• SIAM page for Tarjan depth-first-search paper
• DBLP record for Tarjan graph algorithms

Provisional WRS assessment, edition 2026-10-16.1. Independent expert calibration is pending. This grade does not certify correctness or assign ownership.

Full scientific record · Browse contribution grades · Request a correction