1.5.10 Steiner Tree

Problem Input | Problem Output 


INPUT                    OUTPUT

Input Description: A graph G=(V,E) . A subset of vertices T \in V .

Problem: Find the smallest tree connecting all the vertices of T .

Implementations

  • Salowe's Rectilinear Steiner trees (C) (rating 8)
  • PHYLIP -- inferring phylogenic trees (Pascal) (rating 7)

    Related Problems

  • Minimum Spanning Tree
  • Shortest Path

    Go to the corresponding chapter in the book
    About the Book
    Send us Mail
    Go to Main Page

    This page last modified on Tue Jun 03, 1997 .