An algorithm for hierarchical reduction and decomposition of a directed graph

DOI10.1007/BF02243881zbMath0419.05043MaRDI QIDQ1132114

S. H. Smith

Publication date: 1980

Published in: Computing (Search for Journal in Brave)

zbMATH Keywords

algorithm; decomposition; reduction; directed graph; hierarchical

Mathematics Subject Classification ID

05C99: Graph theory

05C20: Directed graphs (digraphs), tournaments

05-04: Software, source code, etc. for problems pertaining to combinatorics

Related Items

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