Table of Contents

Volume 45 Issue 3 (May 2005)


On restricted connectivities of permutation graphs

  • Author: C. Balbuena, X. Marcote, P. García‐Vázquez
  • Pub Online: Mar 08, 2005
  • DOI: 10.1002/net.20056 (p 113-118)

Constructions of sparse asymmetric connectors with number theoretic methods

  • Author: Andreas Baltz, Gerold Jäger, Anand Srivastav
  • Pub Online: Mar 08, 2005
  • DOI: 10.1002/net.20058 (p 119-124)

A branch‐and‐price algorithm for the capacitated p ‐median problem

  • Author: Alberto Ceselli, Giovanni Righini
  • Pub Online: Mar 08, 2005
  • DOI: 10.1002/net.20059 (p 125-142)

The sequential sum problem and performance bounds on the greedy algorithm for the on‐line Steiner problem

  • Author: Zevi Miller, Dan Pritikin, Manley Perkel, I.H. Sudborough
  • Pub Online: Mar 11, 2005
  • DOI: 10.1002/net.20057 (p 143-164)

The strongly connected reliability of complete digraphs

  • Author: J.I. Brown, Xiaohu Li
  • Pub Online: Mar 08, 2005
  • DOI: 10.1002/net.20060 (p 165-168)

Leader election in oriented star graphs

  • Author: Wei Shi, A. Bouabdallah, Pradip K Srimani
  • Pub Online: Mar 10, 2005
  • DOI: 10.1002/net.20052 (p 169-179)

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.