External Links

    Journal: Networks

    Volume 29, Issue 4

    191 -- 194Dilip Chhajed. Edge coloring a k-tree into two smaller trees
    195 -- 203De-Ron Liang, Rong-Hong Jan, Satish K. Tripathi. Reliability analysis of replicated and-or graphs
    205 -- 216Esther M. Arkin, Refael Hassin, Limor Klein. Restricted delivery problems on a network
    219 -- 223Shimon Even, Ami Litman. Layered cross product - A technique to construct interconnection networks
    225 -- 244Shin-Yeu Lin, Ch i-Hsin Lin. A computationally efficient method for nonlinear multicommodity network flow problems
    245 -- 263Takao Asano. Constructing a bipartite graph of maximum connectivity with prescribed degrees

    Volume 29, Issue 3

    135 -- 140Yixun Lin. Minimum bandwidth problem for embedding graphs in cycles
    141 -- 150X. Cai, Ton Kloks, C. K. Wong. Time-varying shortest path problems with constraints
    151 -- 160Collette R. Coullard, L. Leslie Gardner, Donald K. Wagner. Minimum-weight cycles in 3-separable graphs
    161 -- 171Yazid M. Sharaiha, Michel Gendreau, Gilbert Laporte, Ibrahim H. Osman. A tabu search algorithm for the Capacitated Shortest Spanning Tree Problem
    173 -- 189Mauricio G. C. Resende, Celso C. Ribeiro. A GRASP for graph planarization

    Volume 29, Issue 2

    77 -- 80Stephen G. Penrice. Balanced graphs and network flows
    81 -- 87Chin-Chen Chang, Wen-Bin Wu. A secure voting system on a public network
    89 -- 105Cees Duin, Stefan Voß. Efficient path and vertex exchange in steiner tree algorithms
    107 -- 110Akiyoshi Shioura, Maiko Shigeno. The tree center problems and the relationship with the bottleneck knapsack problems
    111 -- 116Zhi-Long Chen, Warren B. Powell. A note on Bertsekas small-label-first strategy
    117 -- 124Hosam M. F. AboElFotoh. Algorithms for computing message delay for wireless networks
    125 -- 133Stefano Pallottino, Maria Grazia Scutellà. Dual algorithms for the shortest path tree problem

    Volume 29, Issue 1

    1 -- 10Amotz Bar-Noy, Shlomo Kipnis. Multiple message broadcasting in the postal model
    11 -- 28Ariel Orda, Raphael Rom. Optimal packet fragmentation and routing in computer networks
    29 -- 37Ramesh S. Sankaranarayana. Tracking the P-NP boundary for well-covered graphs
    39 -- 47Toru Hasunuma, Yukio Shibata. Counting small cycles in generalized de Bruijn digraphs
    49 -- 53Savio S. H. Tse, Francis C. M. Lau. A lower bound for interval routing in general networks
    55 -- 67Matteo Fischetti, Daniele Vigo. A branch-and-cut algorithm for the resource-constrained minimum-weight arborescence problem
    69 -- 76Konstantinos Kalpakis, Yaacov Yesha. On the bisection width of the transposition network
    runs on