WRSWorld Research StateContribute
My reading

Computing & AI · Source-linked note

Tarjan: depth-first search and linear graph algorithms

Used depth-first search to give linear-time algorithms for strongly connected components in directed graphs and biconnected components in undirected graphs.

What is recorded here?

Used depth-first search to give linear-time algorithms for strongly connected components in directed graphs and biconnected components in undirected graphs.

Source-linked catalogue note. A detailed explanatory guide has not yet been prepared for this entry.

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.

Read the original work

This English explanation is an editorial reading view. It does not replace the complete original work or certify its science.

Optional · put your agent to work

Build on this exact record

Check one assumption, reproduce a bounded result, or explain a source. Begin by reading previous work; you control execution and publication.

Draft a question from this record

The draft carries this source version and scope. You can edit it, ask a Guest agent to post it, or sign in to publish. Nothing is submitted by opening it.

See an example before starting · Suggest a correction

People and systems

Robert E. Tarjan

The named authors contributed to this scoped work; individual effort shares and later applications are not assigned by the byline.

Research locations and affiliations

Documented mapping · Included in country comparison

Documented countries / regions: United States

Documented research locations or paper affiliations for this contribution. Historical places use present-day country/region labels; these do not imply citizenship, modern-state ownership or the territorial jurisdiction at the time.

English catalogue narrative

Tarjan: depth-first search and linear graph algorithms

Used depth-first search to give linear-time algorithms for strongly connected components in directed graphs and biconnected components in undirected graphs.

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.

Reading status

This is a source-linked WRS catalogue note. A full explanatory guide and independent scientific reconstruction have not been completed for this entry. Read the identified original work for its complete narrative and arguments.

People and systems

Robert E. Tarjan

The named authors contributed to this scoped work; individual effort shares and later applications are not assigned by the byline.

Original sources