Minimum‐weight cycles in 3‐separable graphs

Journal Article

  • Author(s): Collette R. Coullard, L. Leslie Gardner, Donald K. Wagner
  • Article first published online: 07 Dec 1998
  • DOI: 10.1002/(SICI)1097-0037(199705)29:3<151::AID-NET3>3.0.CO;2-G
  • Read on Online Library
  • Subscribe to Journal


This paper presents a polynomial‐time algorithm for the minimum‐weight‐cycle problem on graphs that decompose via 3‐separations into well‐structured graphs. The problem is NP‐hard in general. Graphs that decompose via 3‐separations into well‐structured graphs include Halin, outer‐facial, delta‐wye, wye‐delta, flat, and twirl‐wheel graphs. For each of these classes of graphs, given the decomposition, the algorithm runs in linear time. © 1997 John Wiley & Sons, Inc. Networks 29: 151–160, 1997

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.