Table of Contents

Volume 31 Issue 1 (January 1998)


Recognizing triangle‐free graphs with induced path‐cycle double covers is NP‐complete

  • Author: Michael S. Jacobson, André E. Kézdy, Jenő Lehel
  • Pub Online: Dec 07, 1998
  • DOI: 10.1002/(SICI)1097-0037(199801)31:1<1::AID-NET1>3.0.CO;2-N (p 1-10)

A strong lower bound for the Node Weighted Steiner Tree Problem

  • Author: Stefan Engevall, Maud Göthe‐Lundgren, Peter Värbrand
  • Pub Online: Dec 07, 1998
  • DOI: 10.1002/(SICI)1097-0037(199801)31:1<11::AID-NET2>3.0.CO;2-N (p 11-17)

On capacitated stochastic chain problems in a network

  • Author: L. Ganapathy, K. P. K. Nair
  • Pub Online: Dec 07, 1998
  • DOI: 10.1002/(SICI)1097-0037(199801)31:1<19::AID-NET3>3.0.CO;2-N (p 19-27)

Tough enough chordal graphs are Hamiltonian

  • Author: Guantao Chen, Michael S. Jacobson, André E. Kézdy, Jenő Lehel
  • Pub Online: Dec 07, 1998
  • DOI: 10.1002/(SICI)1097-0037(199801)31:1<29::AID-NET4>3.0.CO;2-M (p 29-38)

A branch and cut algorithm for the Steiner problem in graphs

  • Author: A. Lucena, J. E. Beasley
  • Pub Online: Dec 07, 1998
  • DOI: 10.1002/(SICI)1097-0037(199801)31:1<39::AID-NET5>3.0.CO;2-L (p 39-59)

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.