Table of Contents

Volume 22 Issue 7 (December 1992)

fmi-fmi, 615-717



  • Author:
  • Pub Online: Oct 11, 2006
  • DOI: 10.1002/net.3230220701 (p fmi-fmi)


Networks communicating for each pairing of terminals

  • Author: László Csaba, Ralph J. Faudree, András Gyárfás, Jenö Lehel, Richard H. Schelp
  • Pub Online: Oct 11, 2006
  • DOI: 10.1002/net.3230220702 (p 615-626)

A message‐routing strategy for multicomputer systems

  • Author: Hyeong‐Ah Choi, Abdol‐Hossein Esfahanian
  • Pub Online: Oct 11, 2006
  • DOI: 10.1002/net.3230220703 (p 627-646)

Counting k ‐component forests of a graph

  • Author: Wendy Myrvold
  • Pub Online: Oct 11, 2006
  • DOI: 10.1002/net.3230220704 (p 647-652)

Finding disjoint paths with different path‐costs: Complexity and algorithms

  • Author: Chung‐Lun Li, S. Thomas McCormick, David Simchi‐Levi
  • Pub Online: Oct 11, 2006
  • DOI: 10.1002/net.3230220705 (p 653-667)

The Capacitated Arc Routing Problem: Lower bounds

  • Author: E. Benavent, V. Campos, A. Corberan, E. Mota
  • Pub Online: Oct 11, 2006
  • DOI: 10.1002/net.3230220706 (p 669-690)

Level graphs and approximate shortest path algorithms

  • Author: Jacob Shapiro, Jerry Waxman, Danny Nir
  • Pub Online: Oct 11, 2006
  • DOI: 10.1002/net.3230220707 (p 691-717)

Related Topics

Related Publications

Related Content

Site Footer


This website is provided by John Wiley & Sons Limited, The Atrium, Southern Gate, Chichester, West Sussex PO19 8SQ (Company No: 00641132, VAT No: 376766987)

Published features on are checked for statistical accuracy by a panel from the European Network for Business and Industrial Statistics (ENBIS)   to whom Wiley and express their gratitude. This panel are: Ron Kenett, David Steinberg, Shirley Coleman, Irena Ograjenšek, Fabrizio Ruggeri, Rainer Göb, Philippe Castagliola, Xavier Tort-Martorell, Bart De Ketelaere, Antonio Pievatolo, Martina Vandebroek, Lance Mitchell, Gilbert Saporta, Helmut Waldl and Stelios Psarakis.