Public reporting burden for the collection of information is estimated to average 1 hour per response, including the time for reviewing instructions, searching existing data sources, gathering and maintaining the data needed, and completing and reviewing the collection of information.

The 2-connected Steiner subgraph problem is that of finding a minimum-weight 2-connected subgraph that spans a subset of distinguished vertices. This paper presents linear-time algorithms for solving the 2-connected Steiner subgraph problem on two special classes of graphs, W4-free graphs and Halin graphs. Although different in detail, the algorithms adopt a common strategy exploiting known decompositions. As a special case, the algorithms also solve the Traveling Salesman Problem on W4-free graphs and Halin graphs. 0 1993 by John Wiley & Sons, Inc.

No abstract

Public reporting burden for the collection of information is estimated to average 1 hour per response, including the time for reviewing instructions, searching existing data sources, gathering and maintaining the data needed, and completing and reviewing the collection of information.