Networks

Table of Contents

Volume 42 Issue 4 (December 2003)

181-222

Unilaterally connected large digraphs and generalized cycles

  • Author: José Gómez, Eduardo A. Canale, Xavier Muñoz
  • Pub Online: Sep 08, 2003
  • DOI: 10.1002/net.10095 (p 181-188)

Fault Hamiltonicity and fault Hamiltonian connectivity of the ( n , k )‐star graphs

  • Author: Hong‐Chun Hsu, Yi‐Lin Hsieh, Jimmy J. M. Tan, Lih‐Hsing Hsu
  • Pub Online: Sep 08, 2003
  • DOI: 10.1002/net.10096 (p 189-201)

A polynomial‐time approximation scheme for the minimum‐connected dominating set in ad hoc wireless networks

  • Author: Xiuzhen Cheng, Xiao Huang, Deying Li, Weili Wu, Ding‐Zhu Du
  • Pub Online: Sep 08, 2003
  • DOI: 10.1002/net.10097 (p 202-208)

On the power of BFS to determine a graph's diameter

  • Author: Derek G. Corneil, Feodor F. Dragan, Ekkehard Köhler
  • Pub Online: Sep 10, 2003
  • DOI: 10.1002/net.10098 (p 209-222)

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.