An algorithm for hierarchical reduction and decomposition of a directed graph

DOI10.1007/BF02243881MaRDI QIDQ1132114zbMATH OpenOpenAlexFDO

Authors S. H. Smith

Publication date 1980

Published in Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02243881

zbMATH Keywords

algorithmdecompositiondirected graphhierarchicalreduction

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to combinatorics (05-04) Directed graphs (digraphs), tournaments (05C20) Graph theory (05C99)

Cites work

• Ein Algorithmus für Teilnetzpläne
• Graph Theory
• scientific article; zbMATH DE number 3290993 (Why is no real title available?)
• scientific article; zbMATH DE number 3363588 (Why is no real title available?)

Cited in

(2)

• The discrete time-cost tradeoff problem revisited
• Optimal procedures for the discrete time/cost trade-off problem in project networks

This page was built for publication: An algorithm for hierarchical reduction and decomposition of a directed graph

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