Depth-first K-trees and critical path analysis (Q1138380)

From MaRDI portal
Revision as of 04:42, 13 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Depth-first K-trees and critical path analysis
scientific article

    Statements

    Depth-first K-trees and critical path analysis (English)
    0 references
    0 references
    0 references
    1980
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    tree representations of digraphs
    0 references
    depth-first search trees
    0 references
    nonrecursive algorithms
    0 references
    topological ordering of an acyclic digraph
    0 references
    critical path analysis of a scheduling network
    0 references
    longest paths from a single sorce in an acyclic digraph
    0 references
    strong components of a digraph
    0 references