Depth-first K-trees and critical path analysis (Q1138380): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Simula 67 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4091421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A non-recursive technique for recreating a digraph from its K-formula representation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Backtrack Procedure for Isomorphism of Directed Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4079014 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on two problems in connexion with graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4178457 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycle detection in critical path networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4057549 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Flow Analysis Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representing Graphs by Knuth Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5676994 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Depth-First Search and Linear Graph Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Dominators in Directed Graphs / rank
 
Normal rank

Latest revision as of 03:42, 13 June 2024

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
    1980
    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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references