Tucker, A. C.; Zemanian, A. H. A matroid related to finitely chainlike, countably infinite networks. (English) Zbl 0542.94042 Networks 12, 453-457 (1982). MSC: 94C30 05B35 PDFBibTeX XMLCite \textit{A. C. Tucker} and \textit{A. H. Zemanian}, Networks 12, 453--457 (1982; Zbl 0542.94042) Full Text: DOI
Shore, M. L.; Foulds, L. R.; Gibbons, P. B. An algorithm for the Steiner problem in graphs. (English) Zbl 0514.05036 Networks 12, 323-333 (1982). MSC: 05C35 05C40 68R10 PDFBibTeX XMLCite \textit{M. L. Shore} et al., Networks 12, 323--333 (1982; Zbl 0514.05036) Full Text: DOI
Chen, Chih-Kang Eric; Garfinkel, R. S. The generalized diameter of a graph. (English) Zbl 0508.90034 Networks 12, 335-340 (1982). MSC: 90B05 05C35 05C38 PDFBibTeX XMLCite \textit{C.-K. E. Chen} and \textit{R. S. Garfinkel}, Networks 12, 335--340 (1982; Zbl 0508.90034) Full Text: DOI
Rotem, D.; Urrutia, J. Circular permutation graphs. (English) Zbl 0508.05060 Networks 12, 429-437 (1982). MSC: 05C99 PDFBibTeX XMLCite \textit{D. Rotem} and \textit{J. Urrutia}, Networks 12, 429--437 (1982; Zbl 0508.05060) Full Text: DOI
Itai, A.; Perl, Y.; Shiloach, Y. The complexity of finding maximum disjoint paths with length constraints. (English) Zbl 0504.68041 Networks 12, 277-286 (1982). MSC: 68R10 68Q25 05C40 PDFBibTeX XMLCite \textit{A. Itai} et al., Networks 12, 277--286 (1982; Zbl 0504.68041) Full Text: DOI
Kwan, C. L.; Toida, S. An optimal 2-FT realization of binary symmetric hierarchical tree systems. (English) Zbl 0499.94034 Networks 12, 231-239 (1982). MSC: 94C15 94C30 PDFBibTeX XMLCite \textit{C. L. Kwan} and \textit{S. Toida}, Networks 12, 231--239 (1982; Zbl 0499.94034) Full Text: DOI
Harary, Frank; Lindström, Bernt; Zetterström, Hans-Olov On balance in group graphs. (English) Zbl 0496.05052 Networks 12, 317-321 (1982). MSC: 05C99 05C35 05B20 05C38 05C75 PDFBibTeX XMLCite \textit{F. Harary} et al., Networks 12, 317--321 (1982; Zbl 0496.05052) Full Text: DOI
Hamacher, Horst Determining minimal cuts with a minimal number of arcs. (English) Zbl 0495.90083 Networks 12, 493-504 (1982). MSC: 90C35 PDFBibTeX XMLCite \textit{H. Hamacher}, Networks 12, 493--504 (1982; Zbl 0495.90083) Full Text: DOI
Bazaraa, Mokhtar S.; Sherali, Hanif D. A property regarding degenerate pivots for linear assignment networks. (English) Zbl 0494.90080 Networks 12, 469-474 (1982). MSC: 90C35 52Bxx PDFBibTeX XMLCite \textit{M. S. Bazaraa} and \textit{H. D. Sherali}, Networks 12, 469--474 (1982; Zbl 0494.90080) Full Text: DOI
Zemel, Eitan Polynomial algorithms for estimating network reliability. (English) Zbl 0494.90034 Networks 12, 439-452 (1982). MSC: 90B25 90C90 68Q25 PDFBibTeX XMLCite \textit{E. Zemel}, Networks 12, 439--452 (1982; Zbl 0494.90034) Full Text: DOI Link
Gavish, Bezalel Topological design of centralized computer networks - formulations and algorithms. (English) Zbl 0493.94021 Networks 12, 355-377 (1982). MSC: 94C15 94-04 68N99 PDFBibTeX XMLCite \textit{B. Gavish}, Networks 12, 355--377 (1982; Zbl 0493.94021) Full Text: DOI
Farley, Arthur M.; Proskurowski, Andrzej Networks immune to isolated line failures. (English) Zbl 0493.94020 Networks 12, 393-403 (1982). MSC: 94C15 PDFBibTeX XMLCite \textit{A. M. Farley} and \textit{A. Proskurowski}, Networks 12, 393--403 (1982; Zbl 0493.94020) Full Text: DOI
Exoo, Geoffrey On a measure of communication network vulnerability. (English) Zbl 0493.94019 Networks 12, 405-409 (1982). MSC: 94C15 PDFBibTeX XMLCite \textit{G. Exoo}, Networks 12, 405--409 (1982; Zbl 0493.94019) Full Text: DOI
Murty, Katta G.; Perin, Clovis A 1-matching blossom-type algorithm for edge covering problems. (English) Zbl 0493.68069 Networks 12, 379-391 (1982). MSC: 68R10 94C15 68Q25 05C70 PDFBibTeX XMLCite \textit{K. G. Murty} and \textit{C. Perin}, Networks 12, 379--391 (1982; Zbl 0493.68069) Full Text: DOI
Katoh, N.; Ibaraki, T.; Mine, H. An efficient algorithm for K shortest simple paths. (English) Zbl 0493.68068 Networks 12, 411-427 (1982). MSC: 68R10 68Q25 05C35 05C38 PDFBibTeX XMLCite \textit{N. Katoh} et al., Networks 12, 411--427 (1982; Zbl 0493.68068) Full Text: DOI
Gupta, U. I.; Lee, D. T.; Leung, J. Y.-T. Efficient algorithms for interval graphs and circular-arc graphs. (English) Zbl 0493.68066 Networks 12, 459-467 (1982). MSC: 68R10 68Q25 05C35 PDFBibTeX XMLCite \textit{U. I. Gupta} et al., Networks 12, 459--467 (1982; Zbl 0493.68066) Full Text: DOI
Somers, J. E. Maximum flow in networks with a small number of random arc capacities. (English) Zbl 0491.90040 Networks 12, 241-253 (1982). MSC: 90B10 90C35 90C31 90C15 65K05 PDFBibTeX XMLCite \textit{J. E. Somers}, Networks 12, 241--253 (1982; Zbl 0491.90040) Full Text: DOI
Tsukiyama, Shuji; Kuh, Ernest S. Double-row planar routing and permutation layout. (English) Zbl 0489.94040 Networks 12, 287-316 (1982). MSC: 94C99 05A05 90B10 68Q25 68R99 PDFBibTeX XMLCite \textit{S. Tsukiyama} and \textit{E. S. Kuh}, Networks 12, 287--316 (1982; Zbl 0489.94040) Full Text: DOI
Segall, Adrian Decentralized maximum-flow protocols. (English) Zbl 0489.90042 Networks 12, 213-230 (1982). MSC: 90B10 65K05 90C35 PDFBibTeX XMLCite \textit{A. Segall}, Networks 12, 213--230 (1982; Zbl 0489.90042) Full Text: DOI
Boesch, F. T.; Suffel, C. L. Realizability of p-point, q-line graphs with prescribed point connectivity, line connectivity, or minimum degree. (English) Zbl 0489.05037 Networks 12, 341-350 (1982). MSC: 05C40 05C35 PDFBibTeX XMLCite \textit{F. T. Boesch} and \textit{C. L. Suffel}, Networks 12, 341--350 (1982; Zbl 0489.05037) Full Text: DOI
Frank, Ove; Gaul, Wolfgang On reliability in stochastic graphs. (English) Zbl 0488.62081 Networks 12, 119-126 (1982). MSC: 62N05 05C40 90B25 PDFBibTeX XMLCite \textit{O. Frank} and \textit{W. Gaul}, Networks 12, 119--126 (1982; Zbl 0488.62081) Full Text: DOI
Erickson, Ranel E. Generalizations of planar graphs. (English) Zbl 0488.05029 Networks 12, 127-140 (1982). MSC: 05C10 PDFBibTeX XMLCite \textit{R. E. Erickson}, Networks 12, 127--140 (1982; Zbl 0488.05029) Full Text: DOI
Shogan, Andrew W. Modular decomposition and reliability computation in stochastic transportation networks having cutnodes. (English) Zbl 0486.90046 Networks 12, 255-275 (1982). MSC: 90B25 90C35 90B10 65K05 PDFBibTeX XMLCite \textit{A. W. Shogan}, Networks 12, 255--275 (1982; Zbl 0486.90046) Full Text: DOI
Sheffi, Yosef; Powell, Warren B. An algorithm for the equilibrium assignment problem with random link times. (English) Zbl 0485.90082 Networks 12, 191-207 (1982). MSC: 90C35 65K05 90C15 PDFBibTeX XMLCite \textit{Y. Sheffi} and \textit{W. B. Powell}, Networks 12, 191--207 (1982; Zbl 0485.90082) Full Text: DOI
Picard, Jean-Claude; Queyranne, Maurice A network flow solution to some nonlinear 0-1 programming problems, with application to graph theory. (English) Zbl 0485.90081 Networks 12, 141-159 (1982). MSC: 90C35 90C09 90B10 90C30 65K05 05C35 90B35 91B06 PDFBibTeX XMLCite \textit{J.-C. Picard} and \textit{M. Queyranne}, Networks 12, 141--159 (1982; Zbl 0485.90081) Full Text: DOI
Zipkin, Paul H. Aggregation and disaggregation in convex network problems. (English) Zbl 0485.90080 Networks 12, 101-117 (1982). MSC: 90C35 05C35 65K05 PDFBibTeX XMLCite \textit{P. H. Zipkin}, Networks 12, 101--117 (1982; Zbl 0485.90080) Full Text: DOI
Jarvis, John J.; Tufekci, Suleyman A decomposition algorithm for locating a shortest path between two nodes in a network. (English) Zbl 0484.68050 Networks 12, 161-172 (1982). MSC: 68R10 94C15 90B10 05C38 68Q25 PDFBibTeX XMLCite \textit{J. J. Jarvis} and \textit{S. Tufekci}, Networks 12, 161--172 (1982; Zbl 0484.68050) Full Text: DOI
Martello, Silvano; Toth, Paolo Finding a minimum equivalent graph of a digraph. (English) Zbl 0484.68049 Networks 12, 89-100 (1982). MSC: 68R10 05C20 68Q25 PDFBibTeX XMLCite \textit{S. Martello} and \textit{P. Toth}, Networks 12, 89--100 (1982; Zbl 0484.68049) Full Text: DOI
Cutler, M.; Riesel, Z. Minimum width 2-layer layout of a multichanneled system. (English) Zbl 0484.68030 Networks 12, 173-189 (1982). MSC: 68Q25 94C15 PDFBibTeX XMLCite \textit{M. Cutler} and \textit{Z. Riesel}, Networks 12, 173--189 (1982; Zbl 0484.68030) Full Text: DOI
Rowe, Harrison E.; Mammel, Wanda L. Counting formulas for tree growth plans. (English) Zbl 0478.94033 Networks 12, 41-56 (1982). MSC: 94C15 05C05 PDFBibTeX XMLCite \textit{H. E. Rowe} and \textit{W. L. Mammel}, Networks 12, 41--56 (1982; Zbl 0478.94033) Full Text: DOI
Frieze, A. M.; Galbiati, G.; Maffioli, F. On the worst-case performance of some algorithms for the asymmetric traveling salesman problem. (English) Zbl 0478.90070 Networks 12, 23-39 (1982). MSC: 90C35 68Q25 65K05 PDFBibTeX XMLCite \textit{A. M. Frieze} et al., Networks 12, 23--39 (1982; Zbl 0478.90070) Full Text: DOI
Dafermos, Stella The general multimodal network equilibrium problem with elastic demand. (English) Zbl 0478.90022 Networks 12, 57-72 (1982). MSC: 90B20 90C35 90B10 65K05 PDFBibTeX XMLCite \textit{S. Dafermos}, Networks 12, 57--72 (1982; Zbl 0478.90022) Full Text: DOI
Hassin, Refael Minimum cost flow with set-constraints. (English) Zbl 0478.90019 Networks 12, 1-21 (1982). MSC: 90B10 90C35 PDFBibTeX XMLCite \textit{R. Hassin}, Networks 12, 1--21 (1982; Zbl 0478.90019) Full Text: DOI
Berman, Oded; Odoni, Amedeo R. Locating mobile servers on a network with Markovian properties. (English) Zbl 0478.90016 Networks 12, 73-86 (1982). MSC: 90B05 90B22 90C10 90C90 90C35 90B10 65K05 05C05 PDFBibTeX XMLCite \textit{O. Berman} and \textit{A. R. Odoni}, Networks 12, 73--86 (1982; Zbl 0478.90016) Full Text: DOI