Steiner Problem Research Articles

The steiner problem in graphs

AbstractAn algorithm for solving the Steiner problem on a finite undirected graph is presented. This algorithm computes the set of graph arcs of minimum total length needed to connect a specified set of k graph nodes. If the entire graph contains n nodes, the algorithm requires time proportional to n3/2 + n2 (2k‐1 ‐ k ‐ 1) + n(3k‐1 ‐ 2k + 3)/2.The time requirement above includes the term n3/2, which can be eliminated if the set of shortest paths connecting each pair of nodes in the graph is available.

On a problem of H.-G. Steiner

Steiner's problem: In which fields the formula √ ab = √ a√ b makes sense is generalized and solved for n-th roots. Furthermore the periodic abelian groups which can be complemented in any abelian extension with torsionfree factor group are characterized.

On Steiner's network problem

MathematikaVolume 8, Issue 2 p. 131-132 Research Article On Steiner's network problem J. M. Hammersley, J. M. Hammersley Institute of Statistics, OxfordSearch for more papers by this author J. M. Hammersley, J. M. Hammersley Institute of Statistics, OxfordSearch for more papers by this author First published: 01 December 1961 https://doi.org/10.1112/S0025579300002242Citations: 2AboutPDF ToolsRequest permissionExport citationAdd to favoritesTrack citation ShareShare Give accessShare full text accessShare full-text accessPlease review our Terms and Conditions of Use and check box below to share full-text version of article.I have read and accept the Wiley Online Library Terms and Conditions of UseShareable LinkUse the link below to share a full-text version of this article with your friends and colleagues. Learn more.Copy URL Share a linkShare onFacebookTwitterLinkedInRedditWechat No abstract is available for this article.Citing Literature Volume8, Issue2December 1961Pages 131-132 RelatedInformation

Multi-Terminal Network Flows

Multi-Terminal Network Flows