Edge-disjoint spanning trees and depth-first search

Tarjan, R. E. (1976). Edge-disjoint spanning trees and depth-first search. Acta Informatica, 6(2), 171-185.

Type

Journal article

Intellectual base

Primary research

Year

1976

Volume

6

Issue

2

Pages

171-185

DOI registrant

Springer Nature

Link

https://doi.org/10.1007/bf00268499matched

Cited from

operations_research

Cited by

1 citation across 1 artifact.

Primes

• Sequencing
  • The Ω-logic of sequencing—respecting prerequisites, minimizing idle time, identifying bottlenecks—is universal; the implementation details vary, as Tarjan (1976) demonstrated when his depth-first-search topological-sort algorithm—originally a graph-theory result—became the canonical engine for compiler build orders, dependency resolvers, and scheduling pipelines.

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:b8f0658c1e70 · see in the full table