Depth-first K-trees and critical path analysis

DOI10.1007/BF00288768MaRDI QIDQ1138380zbMATH OpenFDO

Authors 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) Directed graphs (digraphs), tournaments (05C20) Graph theory (including graph drawing) in computer science (68R10) Deterministic scheduling theory in operations research (90B35)

Cites work

• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• scientific article; zbMATH DE number 3497312 (Why is no real title available?)
• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• scientific article; zbMATH DE number 3614143 (Why is no real title available?)
• scientific article; zbMATH DE number 3412093 (Why is no real title available?)
• A Backtrack Procedure for Isomorphism of Directed Graphs
• A Flow Analysis Algorithm
• A non-recursive technique for recreating a digraph from its K-formula representation
• A note on two problems in connexion with graphs
• Cycle detection in critical path networks
• Depth-First Search and Linear Graph Algorithms
• Finding Dominators in Directed Graphs
• Representing Graphs by Knuth Trees

Cited in

(2)

• Shape measures of random increasing \(k\)-trees
• A taxonomy of binary tree traversals

Describes a project that uses

Uses Software

• Simula 67

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1138380)