Networks, Volume 27

Volume 27, Number 1, January 1996

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

Volume 27, Number 2, March 1996

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

Volume 27, Number 3, May 1996

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

Volume 27, Number 4, July 1996

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