External Links

    Journal: Networks

    Volume 5, Issue 4

    1 -- 6S. L. Hakimi. The Program, Conclusions and Recommendations
    7 -- 32Howard Frank. Computer Networks: Art to Science to Art
    33 -- 43S. Lin. Heuristic Programming as an Aid to Network Design
    45 -- 68Richard M. Karp. On the Computational Complexity of Combinatorial Problems
    69 -- 73H. Frank. Computer Networks
    75 -- 79Denos C. Gazis. Transportation Networks
    81 -- 84Hermann W. Dommel. Energy Networks
    85 -- 88Maurice Hanan. Layout, Interconnection, and Placement
    89 -- 92Eugene L. Lawler. Algorithms, Graphs, and Complexity
    93 -- 96L. S. Lasdon. Partitions, Decomposition, Sparsity
    97 -- 100Richard M. Van Slyke. Stochastic Aspects of Networks
    101 -- 103P. Weiner. Heuristics
    301 -- 305A. Rosenthal. A bit-pushing shortest distance algorithm
    307 -- 329R. D. Barnard. Optimal-aim regulation and tracking in large-order nonlinear networks
    331 -- 356Bruce L. Golden. A minimum-cost multicommodity network flow problem concerning imports and exports
    357 -- 370Jean-Claude Picard, H. Donald Ratliff. Minimum cuts and related problems
    371 -- 387R. L. Tobin. Minimal complete matchings and negative cycles

    Volume 5, Issue 3

    205 -- 236Izhak Rubin. Multiterminal Path Flows for Packet-Switching Communication Networks
    237 -- 252Ronald C. Read, Robert E. Tarjan. Bounds on Backtrack Algorithms for Listing Cycles, Paths, and Spanning Trees
    253 -- 298Robert E. Bixby. The Minimum Number of Edges and Vertices in a Graph with Edge Connectivity n and m n-Bonds
    299 -- 300N. Deo. Graph Theory with Applications to Engineering and Computer Science

    Volume 5, Issue 2

    109 -- 128I. Paz. On the Traffic Handling Capability of Communication Networks Homogeneously Loaded
    129 -- 149A. R. Pierce. Bibliography on Algorithms for Shortest Path, Shortest Spanning Tree, and Related Circuit Routing Problems (1956-1974)
    151 -- 177Luigi Fratta, Ugo Montanari. A Vertex Elimination Algorithm for Enumerating all Simple Paths in a Graph
    179 -- 201L. Weinberg. Duality in Networks: Roses, Bouquets, and Cut-Sets; Trees, Forests and Polygons
    203 -- 204. TRAFFIC SCIENCE
    runs on