Journal: Networks

Volume 23, Issue 8

651 -- 660Dominique de Werra, Ph. Solot. Some graph-theoretical models for scheduling in automated production systems
661 -- 673Éric D. Taillard. Parallel iterative search methods for vehicle routing problems
675 -- 679S. Geetha, K. P. K. Nair. On stochastic spanning tree problem
681 -- 690Brunilde Sansò, François Soumis. The dynamic predicate stashing copy problem
691 -- 701Douglas M. Blough, Andrzej Pelc. Optimal communication in networks with randomly distributed byzantine faults
703 -- 709Dimitri P. Bertsekas. A simple and fast label correcting algorithm for shortest paths

Volume 23, Issue 7

575 -- 595Linos F. Frantzeskakis, Warren B. Powell. Bounding procedures for multistage stochastic dynamic networks
597 -- 603Srinivas Y. Prasad, Rajan Batta. M/G/1 queue
605 -- 621Christos Alexopoulos, George S. Fishman. Sensitivity analysis in stochastic flow networks using the Monte Carlo method
623 -- 630Richard A. Sandbothe. Backordering in a multiperiod transshipment network
631 -- 640André Langevin, Martin Desrochers, Jacques Desrosiers, Sylvie Gélinas, François Soumis. A two-commodity flow formulation for the traveling salesman and the makespan problems with time windows
641 -- 649Vance Faber, James W. Moore, William Y. C. Chen. Cycle prefix digraphs for symmetric interconnection networks

Volume 23, Issue 6

517 -- 523Dan Trietsch. Optimal multifacility defensive location on planes with rectilinear distances
525 -- 532Kavindra Malik, Gang Yu. A branch and bound algorithm for the capacitated minimum spanning tree problem
533 -- 541Arkady Kanevsky. Finding all minimum-size separating vertex sets in a graph
543 -- 555S. Louis Hakimi, Edward F. Schmeichel, Martine Labbé. On locating path- or tree-shaped facilities on networks
557 -- 565Byung-Wook Wie. A differential game model of Nash equilibrium on a congested traffic network
567 -- 574Mark Hartmann, James B. Orlin. Finding minimum cost to time ratio cycles with small integral transit times

Volume 23, Issue 5

451 -- 458Xiao-Dong Hu, Frank K. Hwang, Wen-Ch'Ing Winnie Li. Most reliable double loop networks in survival reliability
459 -- 471Edwin Hsing-Mean Sha, Kenneth Steiglitz. Maintaining bipartite matchings in the presence of failures
473 -- 479Teresa W. Haynes, Linda M. Lawson. Applications of E-graphs in network design
481 -- 497Jose A. Ventura, Xiaohua Weng. A new method for constructing minimal broadcast networks
499 -- 516Paul Dagum, Eric Horvitz. A Bayesian analysis of simulation algorithms for inference in belief networks

Volume 23, Issue 4

211 -- 213D. Frank Hsu. Introduction
215 -- 225Selim G. Akl, Ke Qiu, Ivan Stojmenovic. Fundamental algorithms for the star and pancake interconnection networks with applications to computational geometry
227 -- 236Watcharaphong Ananchuen, Louis Caccetta. On the adjacency properties of paley graphs
237 -- 248Erwin M. Bakker, Jan van Leeuwen. d-emulations of rings, with an application to distributed virtual ring construction
249 -- 255Abdelmadjid Bouabdallah, Dominique Sotteau. On the edge forwarding index problem for small graphs
257 -- 260Sheng Chen, Xing-De Jia. Undirected loop networks
261 -- 270Wen-Shyen E. Chen, Kyungsook Y. Lee, Ming T. Liu. μ-star: An indirect star network
271 -- 282Luisa Gargano, Adele A. Rescigno, Ugo Vaccaro. Fault - tolerant hypercube broadcasting via information dispersal
283 -- 287Yahya Ould Hamidoune. The minimum order of a cayley graph with given degree and diameter
289 -- 297Daryl D. Harms, Charles J. Colbourn. Renormalization of two - terminal reliability
299 -- 308Jyun-Jy Hu, Shi-Nine Yang, Maw-Sheng Chern. A unidirectional ring partition problem
309 -- 313Chun-Nan Hung, Lih-Hsing Hsu, Ting-Yi Sung. The most vital edges of matching in a bipartite graph
315 -- 326Jung-Sing Jwo, S. Lakshmivarahan, Sudarshan K. Dhall. A new class of interconnection networks based on the alternating group
327 -- 332Gyula O. H. Katona, Wojbor A. Woyczynski. Optimization of the reliability polynomial in presence of mediocre elements
333 -- 341Roger Labahn. Some minimum gossip graphs
343 -- 363Arthur L. Liestman, Thomas C. Shermer. Additive graph spanners
365 -- 378Yuh-Dauh Lyuu. Fast fault-tolerant parallel communication for de bruijn and digit-exchange networks using information dispersal
379 -- 389Dhiraj K. Pradhan, Fred J. Meyer. Communication structures in fault-tolerant distributed systems
391 -- 398Mark Ramras. Routing permutations on a graph
399 -- 414Hong Shen, Ralph-Johan Back. Construction of large-size interconnection networks with high performance
415 -- 426Jerry L. Trahan, Suresh Rai. Reliability evaluation and decision problems in extra stage shuffle-exchange MINs
427 -- 439Anujan Varma, Suresh Chalasani. Asymmetrical multiconnection three-stage clos networks
441 -- 448Abdou Youssef. Off-line permutation routing on circuit-switched fixed-routing networks
449 -- 450Qiao Li, Zhongliang Zhang, Junming Xu. A very short proof of a conjecture concerning set-to-set broadcasting

Volume 23, Issue 3

151 -- 157Lorenzo Traldi. On the star - delta transformation in network reliability
159 -- 164H. J. Broersma, Ralph J. Faudree, Johan H. C. van den Heuvel, Henk Jan Veldman. Decomposition of bipartite graphs under degree constraints
165 -- 173Klaus Jansen. Bounds for the general capacitated routing problem
175 -- 183Gehan A. Corea, Vidyadhar G. Kulkarni. Shortest paths in stochastic networks with ARC lengths having discrete distributions
185 -- 193Ashok T. Amin, Kyle Siegrist, Peter J. Slater. On uniformly optimally reliable graphs for pair-connected reliability with vertex failures
195 -- 206Collette R. Coullard, Abdur Rais, Ronald L. Rardin, Donald K. Wagner. Linear-time algorithms for the 2-connected steiner subgraph problem on special classes of graphs
207 -- 210Martin Farber, Mihály Hujter, Zsolt Tuza. An upper bound on the number of cliques in a graph

Volume 23, Issue 2

81 -- 91Lucio Bianco, Aristide Mingozzi, Salvatore Ricciardelli. The traveling salesman problem with cumulative costs
93 -- 98Dominique de Werra, Pavol Hell, Tiko Kameda, Naoki Katoh, Ph. Solot, Masafumi Yamashita. Graph endpoint coloring and distributed processing
99 -- 102Pierre Hansen, Maolin Zheng. Sharp bounds on the order, size, and stability number of graphs
103 -- 121Thomas L. Magnanti, Prakash Mirchandani. Shortest paths, single origin-destination network design, and associated polyhedra
123 -- 133Arthur L. Liestman, Thomas C. Shermer. Grid spanners
135 -- 142Frank Harary, John P. Hayes. Edge fault tolerance in graphs
143 -- 147G. M. Guisewite, Panos M. Pardalos. A polynomial time solvable concave network flow problem

Volume 23, Issue 1

1 -- 17Jason I. Brown, Charles J. Colbourn, John S. Devitt. Network transformations and bounding network reliability
19 -- 28Michel X. Goemans, Young-Soo Myung. A catalog of steiner tree formulations
29 -- 39Lin Chen, Yaacov Yesha. Efficient parallel algorithms for bipartite permutation graphs
41 -- 52Thomas R. Ervolina, S. Thomas McCormick. Canceling most helpful total cuts for minimum cost network flow
53 -- 58Frank K. Hwang, Gaylord W. Richards. A two-stage network with dual partial concentrators
59 -- 69M. Moscarini. Doubly chordal graphs, steiner trees, and connected domination
71 -- 79Jae-moon Koh, Dong-wan Tcha. Local broadcasting in a tree under minisum criterion