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

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

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:b8f0658c1e70 · see in the full table