Shier, D. R. A decomposition algorithm for optimality problems in tree-structured networks. (English) Zbl 0298.90058 Discrete Math. 6, 175-189 (1973). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 1 ReviewCited in 5 Documents MSC: 90C35 Programming involving graphs or networks 94C10 Switching theory, application of Boolean algebra; Boolean functions (MSC2010) PDF BibTeX XML Cite \textit{D. R. Shier}, Discrete Math. 6, 175--189 (1973; Zbl 0298.90058) Full Text: DOI OpenURL References: [1] Berge, C., The theory of graphs and its applications, (1962), Methuen London · Zbl 0097.38903 [2] Carre, B.A., An algebra for network routing problems, J. inst. math. appl., 7, 273-294, (1971) · Zbl 0219.90020 [3] Hu, T.C., A decomposition algorithm for shortest paths in a network, Operations res., 16, 91-102, (1968) · Zbl 0155.28802 [4] Hu, T.C.; Torres, W.T., Shortcut in the decomposition algorithm for shortest paths in a network, IBM J. res. develop., 13, 387-390, (1969) · Zbl 0194.50801 [5] Land, A.H.; Stairs, S.W., The extension of the cascade algorithm to large graphs, Management sci., 14, 29-33, (1967) · Zbl 0168.18304 [6] Murchland, J.D., A general treatment of partitioning in shortest distance calculations, () · Zbl 0331.90031 [7] Parter, S., The use of linear graphs in Gauss elimination, SIAM rev., 3, 119-130, (1961) · Zbl 0102.11302 [8] Yen, J.Y., On Hu’s decomposition algorithm for shortest paths in a network, Operations res., 19, 983-985, (1971) · Zbl 0235.90055 This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.