External Links

    Journal: Networks

    Volume 27, Issue 4

    215 -- 217Prakash Mirchandani. A simple O(n:::2:::) algorithm for the all-pairs shortest path problem on an interval graph
    219 -- 237Emanuel Melachrinoudis, Mary E. Helander. A single facility location problem on a tree with unreliable edges
    239 -- 251Pierre Fraigniaud, Christian Laforest. Minimum gossip bus networks
    253 -- 0A. Volgenant. An addendum to the most vital edges of matching in a bipartite graph
    255 -- 0Chun-Nan Hung, Lih-Hsing Hsu, Ting-Yi Sung. A response to Volgenant s Addendum on the most vital edges

    Volume 27, Issue 3

    171 -- 174R. Sritharan. A linear time algorithm to recognize circular permutation graphs
    175 -- 181Mauro Dell Amico, Martine Labbé, Francesco Maffioli. Complexity of spanning tree problems with leaf-dependent objectives
    183 -- 196Krzysztof Diks, Andrzej Pelc. Broadcasting with universal lists
    197 -- 201Georg Gunther, Bert Hartnell, Douglas F. Rall. Star-factors and k-bounded total domination
    203 -- 214Hung-Kuei Ku, John P. Hayes. Optimally edge fault-tolerant trees

    Volume 27, Issue 2

    97 -- 108Yves Nobert, Jean-Claude Picard. An optimal algorithm for the mixed Chinese postman problem
    109 -- 115Kalyan T. Talluri. Network synthesis with few edges
    117 -- 123Frieda Granot, Michal Penn, Maurice Queyranne. Disconnecting sets in single and two-terminal-pair networks
    125 -- 131L. Petingi, J. T. Saccoman, L. Schoppmann. Uniformly least reliable graphs
    133 -- 143George H. Polychronopoulos, John N. Tsitsiklis. Stochastic shortest path problems with recourse
    145 -- 157Tung-Yang Ho, Lih-Hsing Hsu, Ting-Yi Sung. Transmitting on various network topologies
    159 -- 167Ju-Young Lee Park, Hyeong-Ah Choi. Circuit-switched row-column broadcasting in torus and mesh networks

    Volume 27, Issue 1

    1 -- 17John A. Ellis. Embedding grids into grids: Techniques for large compression ratios
    19 -- 23Frank Harary, John P. Hayes. Node fault tolerance in graphs
    25 -- 34Franco Blanchini, Maurice Queyranne, Franca Rinaldi, Walter Ukovich. A feedback strategy for periodic network flows
    35 -- 51Tein Y. Chung, Dharma P. Agrawal, Suresh Rai, Tzau J. Chung. A comparative study of doubly connected directed topologies for LANs and MANs
    53 -- 71Eckehart Hotzel. Components and graph automorphisms of standard 2 x 2-switch banyan networks
    73 -- 79Alice Underwood. A modified Melzak procedure for computing node-weighted Steiner trees
    81 -- 93Lloyd Greenwald, Thomas Dean. Package routing in transportation networks with fixed vehicle schedules
    runs on