Depth-First Search and Linear Graph Algorithms¶
Tarjan, R. (1972). Depth-First Search and Linear Graph Algorithms. SIAM Journal on Computing, 146-160.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Domain-specific¶
- Biconnected Component
- A connected graph can therefore contain several blocks even though it has only one ordinary connected component.
This sourceOriginal research source for the block structure and linear DFS algorithm. The small graph motifs here are explicit deductions from its criteria.
- A connected graph can therefore contain several blocks even though it has only one ordinary connected component.
Verification¶
Does it exist? Not checked yet. This entry carries no identifier to resolve. It was extracted from the citation as written in the article, normalized, and deduplicated against the rest of the registry.
Does it back the claim? Not recorded. The single citation of this work carries no recorded support check.
Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.
See how references were verified.
Registry ID ref:bf33cf0d13ce · see in the full table