The steiner tree problem and homogeneous sets
The Steiner tree problem has been extensively studied in the literature because of its various applications (e.g., network design, circuit layout and database query answering). The main result in the paper states that an instance of this problem on a graph G is polynomially reducible to an instance of the same problem on an induced subgraph of G whenever G contains a homogeneous set of nodes (i.e., a set of two or more nodes such that every reamining node in G is adjacent either to all or to none of its nodes). This result allows, in particular, to solve in polynomial time the Steiner tree problem on a new class of graphs, called homogeneous graphs, defined in terms of homogeneous sets, that properly contains some classes of graphs on which the problem is polynomially solvable. A polynomial algorithm to recognize homogeneous graphs is also given.
Unable to display preview. Download preview PDF.
- H.J. Bandelt and H.M. Mulder, Distance — hereditary graphs, Journal of Combinatorial Theory (B) 41 (1986), 182–208.Google Scholar
- D.G. Corneil, H. Lerchs and L. Stewart Burlingham, Complement reducible graphs, Discrete Applied Mathematics 3 (1981), 163–174.Google Scholar
- A. D'Atri and M. Moscarini, Distance-hereditary graphs, Steiner trees and connected domination, SIAM J. on Computing 17 (1988).Google Scholar
- M.C. Golumbic, “Algorithmic graph theory and perfect graphs”, Academic Press, New York, 1980.Google Scholar
- F. Harary, “Graph Theory”, Addison-Wesley, Reading, Massachusetts, 1969.Google Scholar
- R.B. Hayward, Weakly triangulated graphs, Journal of Combinatorial Theory (B) 39 (1985), 200–208.Google Scholar
- E. Howorka, A characterization of distance-hereditary graphs, Quart. J. Math. Oxford (2) 28 (1977), 417–420.Google Scholar
- Johnson, D.S., The NP-Completeness Column: An Ongoing Guide, Journal of Algorithms 6 (1985), 434–451.Google Scholar
- Spinrad, J., On comparability and permutation graphs, SIAM J. on Computing 14 (1985), 658–670.Google Scholar