Tainiter, M. A new deterministic network reliability measure. (English) Zbl 0382.90091 Networks 6, 191-204 (1976). MSC: 90C35 05C35 90B25 94C15 PDF BibTeX XML Cite \textit{M. Tainiter}, Networks 6, 191--204 (1976; Zbl 0382.90091) Full Text: DOI
Thomas, R. E. On optimum path problems. (English) Zbl 0375.90031 Networks 6, 287-305 (1976). MSC: 90B10 90C35 90C90 05C35 65K05 94C10 PDF BibTeX XML Cite \textit{R. E. Thomas}, Networks 6, 287--305 (1976; Zbl 0375.90031) Full Text: DOI
Wongseelashote, A. An algebra for determining all path-values in a network with application to k-shortest-paths problems. (English) Zbl 0375.90030 Networks 6, 307-334 (1976). MSC: 90B10 05C35 05C20 90C35 PDF BibTeX XML Cite \textit{A. Wongseelashote}, Networks 6, 307--334 (1976; Zbl 0375.90030) Full Text: DOI
Orloff, C. S. On general routing problems: Comments. (English) Zbl 0366.90093 Networks 6, 281-284 (1976). MSC: 90C35 90C10 PDF BibTeX XML Cite \textit{C. S. Orloff}, Networks 6, 281--284 (1976; Zbl 0366.90093) Full Text: DOI
Lenstra, J. K.; Rinnooy Kan, A. H. G. On general routing problems. (English) Zbl 0366.90092 Networks 6, 273-280 (1976). MSC: 90C35 90C10 PDF BibTeX XML Cite \textit{J. K. Lenstra} and \textit{A. H. G. Rinnooy Kan}, Networks 6, 273--280 (1976; Zbl 0366.90092) Full Text: DOI
Shier, D. R. Iterative methods for determining the k shortest paths in a network. (English) Zbl 0364.90105 Networks 6, 205-229 (1976). MSC: 90C35 90B10 05C35 PDF BibTeX XML Cite \textit{D. R. Shier}, Networks 6, 205--229 (1976; Zbl 0364.90105) Full Text: DOI
Bird, C. G. On cost allocation for a spanning tree: A game theoretic approach. (English) Zbl 0357.90083 Networks 6, 335-350 (1976). MSC: 91A12 91A80 90B10 PDF BibTeX XML Cite \textit{C. G. Bird}, Networks 6, 335--350 (1976; Zbl 0357.90083) Full Text: DOI
Tamir, A. On totally unimodular matrices. (English) Zbl 0356.15020 Networks 6, 373-382 (1976). MSC: 15A54 05C20 05C15 PDF BibTeX XML Cite \textit{A. Tamir}, Networks 6, 373--382 (1976; Zbl 0356.15020) Full Text: DOI
Gehner, K. R. A necessary condition for the existence of a circuit of any specified length. (English) Zbl 0354.05039 Networks 6, 131-138 (1976). MSC: 05C35 PDF BibTeX XML Cite \textit{K. R. Gehner}, Networks 6, 131--138 (1976; Zbl 0354.05039) Full Text: DOI
Lee, D. H. Low cost drainage networks. (English) Zbl 0348.90061 Networks 6, 351-371 (1976). MSC: 90B10 90C35 05C35 65K05 PDF BibTeX XML Cite \textit{D. H. Lee}, Networks 6, 351--371 (1976; Zbl 0348.90061) Full Text: DOI
Fulkerson, D. R.; Harding, G. C. On edge-disjoint branchings. (English) Zbl 0345.05120 Networks 6, 97-104 (1976). MSC: 05C35 05C05 05C20 90C35 PDF BibTeX XML Cite \textit{D. R. Fulkerson} and \textit{G. C. Harding}, Networks 6, 97--104 (1976; Zbl 0345.05120) Full Text: DOI
Bruno, J.; Weinberg, L. Generalized networks: Networks embedded on a matroid. II. (English) Zbl 0342.94018 Networks 6, 231-272 (1976). MSC: 94C10 05B35 PDF BibTeX XML Cite \textit{J. Bruno} and \textit{L. Weinberg}, Networks 6, 231--272 (1976; Zbl 0342.94018) Full Text: DOI
Hall, M. A. Hydraulic network analysis using (generalized) geometric programming. (English) Zbl 0341.90024 Networks 6, 105-130 (1976). MSC: 90B10 90C05 PDF BibTeX XML Cite \textit{M. A. Hall}, Networks 6, 105--130 (1976; Zbl 0341.90024) Full Text: DOI
Dixon, E. T.; Goodman, S. E. An algorithm for the longest cycle problem. (English) Zbl 0339.90039 Networks 6, 139-149 (1976). MSC: 90C35 90C10 05C35 PDF BibTeX XML Cite \textit{E. T. Dixon} and \textit{S. E. Goodman}, Networks 6, 139--149 (1976; Zbl 0339.90039) Full Text: DOI
Evans, J. R. Maximum flow in probabilistic graphs - the discrete case. (English) Zbl 0339.90017 Networks 6, 161-183 (1976). MSC: 90B15 05C99 90C10 06A06 06B05 PDF BibTeX XML Cite \textit{J. R. Evans}, Networks 6, 161--183 (1976; Zbl 0339.90017) Full Text: DOI
Brown, J. R. An algorithm for r-bases of a directed graph. (English) Zbl 0339.05112 Networks 6, 185-188 (1976). MSC: 05C20 68W99 PDF BibTeX XML Cite \textit{J. R. Brown}, Networks 6, 185--188 (1976; Zbl 0339.05112) Full Text: DOI
Truemper, K. An efficient scaling procedure for gain networks. (English) Zbl 0331.90027 Networks 6, 151-159 (1976). MSC: 90B10 90C35 PDF BibTeX XML Cite \textit{K. Truemper}, Networks 6, 151--159 (1976; Zbl 0331.90027) Full Text: DOI
Williams, A. C.; Bhandiwad, R. A. A generating function approach to queueing network analysis of multiprogrammed computers. (English) Zbl 0328.90032 Networks 6, 1-22 (1976). MSC: 90B10 60K25 65K05 68N01 PDF BibTeX XML Cite \textit{A. C. Williams} and \textit{R. A. Bhandiwad}, Networks 6, 1--22 (1976; Zbl 0328.90032) Full Text: DOI
Geller, D. P. Coding graphs by contractions. (English) Zbl 0328.05140 Networks 6, 23-33 (1976). MSC: 05C99 05C35 94B99 PDF BibTeX XML Cite \textit{D. P. Geller}, Networks 6, 23--33 (1976; Zbl 0328.05140) Full Text: DOI
Bruno, J.; Weinberg, L. Generalized networks: Networks embedded on a matroid. I. (English) Zbl 0324.94017 Networks 6, 53-94 (1976). MSC: 94C10 05B35 PDF BibTeX XML Cite \textit{J. Bruno} and \textit{L. Weinberg}, Networks 6, 53--94 (1976; Zbl 0324.94017) Full Text: DOI
Slater, P. J.; Goodman, S. E.; Hedetniemi, S. T. On the optional Hamiltonian completion problem. (English) Zbl 0323.05121 Networks 6, 35-51 (1976). MSC: 05C35 PDF BibTeX XML Cite \textit{P. J. Slater} et al., Networks 6, 35--51 (1976; Zbl 0323.05121) Full Text: DOI