Networks

Table of Contents

Volume 36 Issue 4 (December 2000)

203-241

The full‐degree spanning tree problem

  • Author: Randeep Bhatia, Samir Khuller, Robert Pless, Yoram J. Sussmann
  • Pub Online: Nov 06, 2000
  • DOI: 10.1002/1097-0037(200012)36:4<203::AID-NET1>3.0.CO;2-U (p 203-209)

Topological expansion of multiple‐ring metropolitan area networks

  • Author: Steven Chamberland, Brunilde Sansò
  • Pub Online: Nov 06, 2000
  • DOI: 10.1002/1097-0037(200012)36:4<210::AID-NET2>3.0.CO;2-Z (p 210-224)

Hamiltonian‐laceability of star graphs

  • Author: Sun‐Yuan Hsieh, Gen‐Huey Chen, Chin‐Wen Ho
  • Pub Online: Nov 06, 2000
  • DOI: 10.1002/1097-0037(200012)36:4<225::AID-NET3>3.0.CO;2-G (p 225-232)

An aggregation approach to solving the network p ‐median problem with link demands

  • Author: Peiwu Zhao, Rajan Batta
  • Pub Online: Nov 06, 2000
  • DOI: 10.1002/1097-0037(200012)36:4<233::AID-NET4>3.0.CO;2-I (p 233-241)

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.