Networks

Table of Contents

Volume 37 Issue 4 (July 2001)

171-232

30th Anniversary Special Paper

A new—old algorithm for minimum‐cut and maximum‐flow in closure graphs

  • Author: Dorit S. Hochbaum
  • Pub Online: Jun 06, 2001
  • DOI: 10.1002/net.1012 (p 171-193)

Balanced network flows. IV. Duality and structure theory

  • Author: Christian Fremuth‐Paeger, Dieter Jungnickel
  • Pub Online: Jun 06, 2001
  • DOI: 10.1002/net.1013 (p 194-201)

Balanced network flows. V. Cycle‐canceling algorithms

  • Author: Christian Fremuth‐Paeger, Dieter Jungnickel
  • Pub Online: Jun 06, 2001
  • DOI: 10.1002/net.1014 (p 202-209)

Balanced network flows. VI. Polyhedral descriptions

  • Author: Christian Fremuth‐Paeger, Dieter Jungnickel
  • Pub Online: Jun 06, 2001
  • DOI: 10.1002/net.1015 (p 210-218)

Stability of networks and protocols in the adversarial queueing model for packet routing

  • Author: Ashish Goel
  • Pub Online: Jun 06, 2001
  • DOI: 10.1002/net.1016 (p 219-224)

Characterization results of all shortest paths interval routing schemes

  • Author: M. Flammini, G. Gambosi, U. Nanni, R.B. Tan
  • Pub Online: Jun 06, 2001
  • DOI: 10.1002/net.1017 (p 225-232)

Related Topics

Related Publications

Related Content

Site Footer

Address:

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 StatisticsViews.com are checked for statistical accuracy by a panel from the European Network for Business and Industrial Statistics (ENBIS)   to whom Wiley and StatisticsViews.com 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.