External Links

    Journal: Networks

    Volume 6, Issue 4

    287 -- 305R. E. Thomas. On optimum path problems
    307 -- 334A. Wongseelashote. An algebra for determining all path-values in a network with application to K-shortest-paths problems
    335 -- 350C. G. Bird. On cost allocation for a spanning tree: A game theoretic approach
    351 -- 371D. H. Lee. Low cost drainage networks
    373 -- 382A. Tamir. On totally unimodular matrices

    Volume 6, Issue 3

    191 -- 204M. Tainiter. A new deterministic network reliability measure
    205 -- 229Douglas R. Shier. Iterative methods for determining the k shortest paths in a network
    231 -- 272J. Bruno, L. Weinberg. Generalized networks: Networks embedded on a matroid, part II
    273 -- 280Jan Karel Lenstra, A. H. G. Rinnooy Kan. On general routing problems
    281 -- 284C. S. Orloff. On general routing problems: Comments
    285 -- 286Geraldine B. Wexelblat. "Travels in Computerland, or Incompatibilities and Interfaces" by Ben Ross Schneider, Jr. Addison-Wesley Publishing Company Reading, Massachusetts 1974, $5.95, 256 pages

    Volume 6, Issue 2

    97 -- 104D. R. Fulkerson, G. C. Harding. On edge-disjoint branchings
    105 -- 130M. A. Hall. Hydraulic network analysis using (generalized) geometric programming
    131 -- 138K. R. Gehner. A necessary condition for the existence of a circuit of any specified length
    139 -- 149E. T. Dixon, S. E. Goodman. An algorithm for the longest cycle problem
    151 -- 159K. Truemper. An efficient scaling procedure for gain networks
    161 -- 183J. R. Evans. Maximum flow in probabilistic graphs-the discrete case
    185 -- 188J. Randall Brown. r-Bases of a Directed Graph
    189 -- 190Daniel P. Heyman. QUEUEING SYSTEMS, VOLUME 1: THEORY by Leonard Kleinrock John Wiley & Sons, Inc., New York, 1975, $19.95, 417 pages

    Volume 6, Issue 1

    1 -- 22A. C. Williams, R. A. Bhandiwad. A generating function approach to queueing network analysis of multiprogrammed computers
    23 -- 33Dennis P. Geller. Coding graphs by contractions
    35 -- 51Peter J. Slater, S. E. Goodman, Stephen T. Hedetniemi. On the optional hamiltonian completion problem
    53 -- 94J. Bruno, L. Weinberg. Generalized networks: Networks embedded on a matroid, part I
    runs on