1971/01/01 by S. L. Hakimi · 3 citations
Business, Management and Accounting · Computer Science · #Computational Geometry and Mesh Generation #Data Management and Algorithms #Facility Location and Emergency Management
paper · doi:10.1002/net.3230010203
crossref issued 1971/01/01 · crossref published 1971/01/01 · crossref published-print 1971/01/01 · openalex publication_date 1971/01/01 · crossref published-online 2006/10/11 · crossref created 2007/05/10 · crossref deposited 2023/11/12 · openalex created_date 2025/10/10 · crossref indexed 2026/07/31 · openalex updated_date 2026/07/31
Abstract A graph theoretic version of Steiner's problem in plane geometry is described. An approach for solving this problem, related to Melzak's solution to Steiner's problem, is presented. The problems of finding “shortest route” and “minimal spanning tree” in graphs become special cases of the Steiner's problem in graphs. It is shown that a solution to this problem also provides us with a solution to the problems of finding a minimum externally stable set and a maximum internally stable set in a graph.