Depth-first K-trees and critical path analysis

DOI10.1007/BF00288768zbMath0431.68064MaRDI QIDQ1138380

A. T. Berztiss

Publication date: 1980

Published in: Acta Informatica (Search for Journal in Brave)

zbMATH Keywords

critical path analysis of a scheduling networkdepth-first search treeslongest paths from a single sorce in an acyclic digraphnonrecursive algorithmsstrong components of a digraphtopological ordering of an acyclic digraphtree representations of digraphs

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Deterministic scheduling theory in operations research (90B35) Directed graphs (digraphs), tournaments (05C20)

Related Items (2)

A taxonomy of binary tree traversals ⋮ Shape Measures of Random Increasing k-trees

Uses Software

• Simula 67

Cites Work

• A note on two problems in connexion with graphs
• Cycle detection in critical path networks
• Finding Dominators in Directed Graphs
• A Backtrack Procedure for Isomorphism of Directed Graphs
• Representing Graphs by Knuth Trees
• A non-recursive technique for recreating a digraph from its K-formula representation
• A Flow Analysis Algorithm
• Depth-First Search and Linear Graph Algorithms
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Depth-first K-trees and critical path analysis