Minieka, Edward A polynomial time algorithm for finding the absolute center of a network. (English) Zbl 0738.90045 Networks 11, No. 4, 351-355 (1981). MSC: 90B80 90C35 90C60 PDF BibTeX XML Cite \textit{E. Minieka}, Networks 11, 351--355 (1981; Zbl 0738.90045) Full Text: DOI OpenURL
Akiyama, Jin; Exoo, Geoffrey; Harary, Frank Covering and packing in graphs. IV: Linear arboricity. (English) Zbl 0479.05027 Networks 11, 69-72 (1981). MSC: 05C05 PDF BibTeX XML Cite \textit{J. Akiyama} et al., Networks 11, 69--72 (1981; Zbl 0479.05027) Full Text: DOI OpenURL
Derigs, Ulrich A shortest augmenting path method for solving minimal perfect matching problems. (English) Zbl 0475.05069 Networks 11, 379-390 (1981). MSC: 05C70 68R10 90C08 PDF BibTeX XML Cite \textit{U. Derigs}, Networks 11, 379--390 (1981; Zbl 0475.05069) Full Text: DOI OpenURL
Zadeh, N. On the elimination of negative cost arcs in flow problems. (English) Zbl 0472.90020 Networks 11, 391-392 (1981). MSC: 90B10 90C08 PDF BibTeX XML Cite \textit{N. Zadeh}, Networks 11, 391--392 (1981; Zbl 0472.90020) Full Text: DOI OpenURL
Anderson, E. J. Mazes: Search games on unknown networks. (English) Zbl 0471.90096 Networks 11, 393-397 (1981). MSC: 91A05 90C35 91A40 90B40 PDF BibTeX XML Cite \textit{E. J. Anderson}, Networks 11, 393--397 (1981; Zbl 0471.90096) Full Text: DOI OpenURL
Florian, M.; Nguyen, S.; Pallottino, S. A dual simplex algorithm for finding all shortest paths. (English) Zbl 0471.90085 Networks 11, 367-378 (1981). MSC: 90C35 05C35 65K05 PDF BibTeX XML Cite \textit{M. Florian} et al., Networks 11, 367--378 (1981; Zbl 0471.90085) Full Text: DOI OpenURL
Boesch, Frank T.; Harary, Frank; Kabell, Jerald A. Graphs as models of communication network vulnerability: Connectivity and persistence. (English) Zbl 0471.05041 Networks 11, 57-63 (1981). MSC: 05C40 94C15 PDF BibTeX XML Cite \textit{F. T. Boesch} et al., Networks 11, 57--63 (1981; Zbl 0471.05041) Full Text: DOI OpenURL
Weber, G. M. Sensitivity analysis of optimal matchings. (English) Zbl 0469.05052 Networks 11, 41-56 (1981). MSC: 05C70 90C10 PDF BibTeX XML Cite \textit{G. M. Weber}, Networks 11, 41--56 (1981; Zbl 0469.05052) Full Text: DOI OpenURL
Moss, Franklin H.; Merlin, Philip M. Some theoretical results in multiple path definition in networks. (English) Zbl 0468.94017 Networks 11, 401-411 (1981). MSC: 94C15 68N99 PDF BibTeX XML Cite \textit{F. H. Moss} and \textit{P. M. Merlin}, Networks 11, 401--411 (1981; Zbl 0468.94017) Full Text: DOI OpenURL
Satyanarayana, A.; Hagstrom, Jane N. Combinatorial properties of directed graphs useful in computing network reliability. (English) Zbl 0468.94016 Networks 11, 357-366 (1981). MSC: 94C15 68N99 PDF BibTeX XML Cite \textit{A. Satyanarayana} and \textit{J. N. Hagstrom}, Networks 11, 357--366 (1981; Zbl 0468.94016) Full Text: DOI OpenURL
Lamprey, R. H.; Barnes, B. H. A new concept of primeness in graphs. (English) Zbl 0468.05063 Networks 11, 279-284 (1981). MSC: 05C75 PDF BibTeX XML Cite \textit{R. H. Lamprey} and \textit{B. H. Barnes}, Networks 11, 279--284 (1981; Zbl 0468.05063) Full Text: DOI OpenURL
Fujishige, Satoru A note on the problem of updating shortest paths. (English) Zbl 0462.68043 Networks 11, 317-319 (1981). MSC: 68R10 05C38 PDF BibTeX XML Cite \textit{S. Fujishige}, Networks 11, 317--319 (1981; Zbl 0462.68043) Full Text: DOI OpenURL
Akiyama, Jin; Boesch, Frank; Era, Hiroshi; Harary, Frank; Tindell, Ralph The cohesiveness of a point of a graph. (English) Zbl 0462.05043 Networks 11, 65-68 (1981). MSC: 05C40 PDF BibTeX XML Cite \textit{J. Akiyama} et al., Networks 11, 65--68 (1981; Zbl 0462.05043) Full Text: DOI OpenURL
Discenza, Joseph Henry A more compact formulation of the symmetric multiple traveling salesman problem with fixed charges. (English) Zbl 0461.90072 Networks 11, 73-75 (1981). MSC: 90C35 PDF BibTeX XML Cite \textit{J. H. Discenza}, Networks 11, 73--75 (1981; Zbl 0461.90072) Full Text: DOI OpenURL
Farley, Arthur M. Networks immune to isolated failures. (English) Zbl 0459.94036 Networks 11, 255-268 (1981). MSC: 94C15 PDF BibTeX XML Cite \textit{A. M. Farley}, Networks 11, 255--268 (1981; Zbl 0459.94036) Full Text: DOI OpenURL
Slater, Peter J. The k-nucleus of a graph. (English) Zbl 0459.94035 Networks 11, 233-242 (1981). MSC: 94C15 05C99 PDF BibTeX XML Cite \textit{P. J. Slater}, Networks 11, 233--242 (1981; Zbl 0459.94035) Full Text: DOI OpenURL
Golden, Bruce L.; Wong, Richard T. Capacitated arc routing problems. (English) Zbl 0459.90083 Networks 11, 305-315 (1981). MSC: 90C35 68Q25 PDF BibTeX XML Cite \textit{B. L. Golden} and \textit{R. T. Wong}, Networks 11, 305--315 (1981; Zbl 0459.90083) Full Text: DOI OpenURL
Larson, Richard C.; Li, Victor O. K. Finding minimum rectilinear distance paths in the presence of barriers. (English) Zbl 0459.90082 Networks 11, 285-304 (1981). MSC: 90C35 90C08 68Q25 65K05 PDF BibTeX XML Cite \textit{R. C. Larson} and \textit{V. O. K. Li}, Networks 11, 285--304 (1981; Zbl 0459.90082) Full Text: DOI OpenURL
Hassin, Refael Generalizations of Hoffman’s existence theorem for circulations. (English) Zbl 0459.90026 Networks 11, 243-254 (1981). MSC: 90B10 05C20 PDF BibTeX XML Cite \textit{R. Hassin}, Networks 11, 243--254 (1981; Zbl 0459.90026) Full Text: DOI OpenURL
MacGregor Smith, J.; Lee, D. T.; Liebman, Judith S. An \(O(n \log n)\) heuristic for Steiner minimal tree problems on the Euclidean metric. (English) Zbl 0459.68032 Networks 11, 23-39 (1981). MSC: 68R10 PDF BibTeX XML Cite \textit{J. MacGregor Smith} et al., Networks 11, 23--39 (1981; Zbl 0459.68032) Full Text: DOI OpenURL
Colbourn, Charles J. On testing isomorphism of permutation graphs. (English) Zbl 0459.68031 Networks 11, 13-21 (1981). MSC: 68R10 06A06 PDF BibTeX XML Cite \textit{C. J. Colbourn}, Networks 11, 13--21 (1981; Zbl 0459.68031) Full Text: DOI OpenURL
Ryan, Doris R.; Chen, Stephen A comparison of three algorithms for finding fundamental cycles in a directed graph. (English) Zbl 0459.68030 Networks 11, 1-12 (1981). MSC: 68R10 05C38 90B10 PDF BibTeX XML Cite \textit{D. R. Ryan} and \textit{S. Chen}, Networks 11, 1--12 (1981; Zbl 0459.68030) Full Text: DOI OpenURL
Rotem, D.; Urrutia, J. Finding maximum cliques in circle graphs. (English) Zbl 0459.68029 Networks 11, 269-278 (1981). MSC: 68R10 05C35 PDF BibTeX XML Cite \textit{D. Rotem} and \textit{J. Urrutia}, Networks 11, 269--278 (1981; Zbl 0459.68029) Full Text: DOI OpenURL
Plesnik, Jan The complexity of designing a network with minimum diameter. (English) Zbl 0459.68028 Networks 11, 77-85 (1981). MSC: 68R10 68Q25 PDF BibTeX XML Cite \textit{J. Plesnik}, Networks 11, 77--85 (1981; Zbl 0459.68028) Full Text: DOI OpenURL
Perl, Yehoshua; Yesha, Yaacov Mean flow scheduling and optimal construction of a treelike communication network. (English) Zbl 0459.68010 Networks 11, 87-92 (1981). MSC: 68M20 68Q25 90B35 PDF BibTeX XML Cite \textit{Y. Perl} and \textit{Y. Yesha}, Networks 11, 87--92 (1981; Zbl 0459.68010) Full Text: DOI OpenURL
Christofides, Nicos; Mingozzi, A.; Toth, P. State-space relaxation procedures for the computation of bounds to routing problems. (English) Zbl 0458.90071 Networks 11, 145-164 (1981). MSC: 90C35 90C39 65K05 PDF BibTeX XML Cite \textit{N. Christofides} et al., Networks 11, 145--164 (1981; Zbl 0458.90071) Full Text: DOI OpenURL