External Links

    Journal: Networks

    Volume 3, Issue 4

    289 -- 304Armin Claus, Daniel J. Kleitman. Cost allocation for a spanning tree
    305 -- 313A. Barnett. On operating a shuttle service
    315 -- 331Norman Zadeh. On building minimum cost communication networks
    333 -- 349S. Ashour, K. Y. Chiu, T. E. Moore. An optimal schedule time of a job shop-like disjunctive graph
    351 -- 365F. G. Commoner. A sufficient condition for a matrix to be totally unimodular
    367 -- 377J. Randall Brown. The chromatic reduction problem
    379 -- 380C. R. Baugh. Seventh annual ieee computer society international conference
    381 -- 382W. L. Price. Graphs and networks - an introduction by W. L. Price, Auerbach Publishers Inc., 1971

    Volume 3, Issue 3

    193 -- 224B. Yaged Jr.. Minimum cost routing for dynamic network models
    225 -- 239D. L. Wang, Daniel J. Kleitman. On the existence of N-connected graphs with prescribed degrees (n ≧ 2)
    241 -- 260S. Louis Hakimi, A. T. Amin. On the design of reliable networks
    261 -- 273F. Gavril. Algorithms for a maximum clique and a maximum independent set of a circle graph
    275 -- 285Eugene L. Lawler. Cutsets and partitions of hypergraphs
    287 -- 288J. D. Murchland. Historical note on optimum spanning arborescences

    Volume 3, Issue 2

    97 -- 133Luigi Fratta, Mario Gerla, Leonard Kleinrock. The flow deviation method: An approach to store-and-forward communication network design
    135 -- 171Marvin V. Zelkowitz, Ashok K. Agrawala. KWIC Index for Computer Networks
    173 -- 181K. M. Chandy, Tachen Lo. The Capacitated Minimum Spanning Tree
    183 -- 190E. C. Gaines Jr., J. M. Taplin. Conference Report
    191 -- 192Stephen Chen. APPLIED GRAPH THEORY by Clifford W. Marshall, Wiley-Interscience, 1971

    Volume 3, Issue 1

    1 -- 31Norman Zadeh. Construction of efficient tree networks: The pipeline problem
    33 -- 52S. Chang, Nicholas DeClaris, R. W. Newcomb. Synthesis of modulation insensitive N-path filters
    53 -- 59Robert W. Rosenthal. The network equilibrium problem in integers
    61 -- 73Andres Weintraub. The shortest and the K-shortest routes as assignment problems
    75 -- 80J. Brody. A probabilistic model of learning by means of problems
    81 -- 94Aaron Kershenbaum, Richard M. Van Slyke. Recursive analysis of network reliability
    95 -- 96Francis T. Boesch. Changing careers in science and engineering edited by Sanborn C. Brown, MIT Press, 1972, 349 pages
    runs on