Table of Contents

Volume 38 Issue 1 (August 2001)


Characterizing the bit permutation networks obtained from the line digraphs of bit permutation networks

  • Author: Frank K. Hwang, Chih‐Hung Yen
  • Pub Online: Jul 06, 2001
  • DOI: 10.1002/net.1018 (p 1-5)

An algorithm for constructing minimal c ‐broadcast networks

  • Author: Shiwoo Lee, José A. Ventura
  • Pub Online: Jul 06, 2001
  • DOI: 10.1002/net.1019 (p 6-21)

Electronic voting in a large‐scale distributed system

  • Author: Gianluca Dini
  • Pub Online: Jul 06, 2001
  • DOI: 10.1002/net.1020 (p 22-32)

The ultracenter and central fringe of a graph

  • Author: Gary Chartrand, Karen S. Novotny, Steven J. Winters
  • Pub Online: Jul 06, 2001
  • DOI: 10.1002/net.1021 (p 33-38)

Efficient communication in unknown networks

  • Author: Luisa Gargano, Andrzej Pelc, Stéphane Pérennes, Ugo Vaccaro
  • Pub Online: Jul 06, 2001
  • DOI: 10.1002/net.1022 (p 39-49)

Local search with perturbations for the prize‐collecting Steiner tree problem in graphs

  • Author: S. A. Canuto, M. G. C. Resende, C. C. Ribeiro
  • Pub Online: Jul 06, 2001
  • DOI: 10.1002/net.1023 (p 50-58)

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.