External Links

    Journal: Networks

    Volume 28, Issue 4

    177 -- 180Yannis Manoussakis, Zsolt Tuza. Optimal routings in communication networks with linearly bounded forwarding index
    181 -- 186Gary Chartrand, Michelle Schultz, Steven J. Winters. On eccentric vertices in graphs
    187 -- 193Lusheng Wang, Tao Jiang. An approximation scheme for some Steiner tree problems in the plane
    195 -- 209Yao-Min Chen, Galen H. Sasaki. Routing in quasi torus networks
    211 -- 219B. Kalantari, Gholamreza B. Khosrovshahi. Magic labeling in graphs: Bounds, complexity, and an application to a variant of TSP
    221 -- 225Dorit S. Hochbaum, Anu Pathria. The bottleneck graph partition problem

    Volume 28, Issue 3

    125 -- 134Kenneth A. Berman. Vulnerability of scheduled networks and a generalization of Menger s Theorem
    135 -- 141James A. Knisely, Renu Laskar. Cyclic gossiping times for some classes of graphs
    143 -- 156Andrzej Pelc. Fault-tolerant broadcasting and gossiping in communication networks
    157 -- 165Mokhtar Aboelaze. MLH: A hierarchical hypercube network
    167 -- 175Tae Ung Kim, Timothy J. Lowe, Arie Tamir, James E. Ward. On the location of a tree-shaped facility

    Volume 28, Issue 2

    69 -- 85Ram Swaminathan. Divide-and-conquer algorithms for graph-layout problems
    87 -- 95Keith E. Humenik, Peter Matthews, A. B. Stephens, Yelena Yesha. Minimizing message complexity of partially replicated data on hypercubes
    97 -- 105Camino Balbuena, Angeles Carmona, Josep Fàbrega, Miguel Angel Fiol. On the connectivity and the conditional diameter of graphs and digraphs
    107 -- 116Anna Nagurney, June Dong. Network decomposition of general financial equilibria with transaction costs
    117 -- 124Pierre Chardaire, Alain Sutter, Marie-Christine Costa. Solving the dynamic facility location problem

    Volume 28, Issue 1

    1 -- 5Oded Berman, Zvi Drezner, George O. Wesolowsky. Minimum covering criterion for obnoxious facility location on a network
    7 -- 14Qiao Li, Dominique Sotteau, Junming Xu. 2-diameter of de Bruijn graphs
    15 -- 19Si-Qing Zheng. Maximum independent sets of circular-arc graphs: Simplified algorithm and proofs
    21 -- 29Geng Lin, Nicholas Pippenger. Routing algorithms for switching networks with probabilistic traffic
    31 -- 43Enrique Castillo, José Manuel Gutiérrez, Ali S. Hadi. A new method for efficient symbolic propagation in discrete Bayesian networks
    45 -- 53J. Ghoshal, Renu Laskar, D. Pillone. Minimal rankings
    55 -- 68J. MacGregor Smith. Topological network design of state-dependent queueing networks
    runs on