Proceedings of the Second Great Lakes Symposium on VLSI (1992)

Kalamazoo, MI, USA

Feb. 28, 1992 to Feb. 29, 1992

ISBN: 0-8186-2610-0

pp: 204-206

K. Makki , Dept. of Comput. Sci., Nevada Univ., Las Vegas, NV, USA

ABSTRACT

The Steiner tree problem is to find a tree in a connected undirected distance graph G=(V, E, d) which spans a given set S contained in V. The minimum Steiner tree for G and S is a tree which spans S with a minimum total distance on its edges. The authors consider a special case of the Steiner tree problem in graphs. For this problem they assume that the underlying graph G does not have any direct edge between the vertices in S contained in V. The problem is to find a tree in G which spans the vertices in S and uses minimum number of vertices in V-S.<>

INDEX TERMS

computational complexity, trees (mathematics)

CITATION

K. Makki and N. Pissinou, "The Steiner tree problem with minimum number of vertices in graphs,"

*Proceedings of the Second Great Lakes Symposium on VLSI(GLSV)*, Kalamazoo, MI, USA, , pp. 204-206.

doi:10.1109/GLSV.1992.218344

CITATIONS