An algorithm for hierarchical reduction and decomposition of a directed graph

DOI10.1007/BF02243881zbMath0419.05043OpenAlexW141046755MaRDI QIDQ1132114

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

algorithmdecompositionreductiondirected graphhierarchical

Mathematics Subject Classification ID

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

Related Items

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

Cites Work

• Ein Algorithmus für Teilnetzpläne
• Graph Theory
• Unnamed Item
• Unnamed Item