Steiner tree

From Wiktionary, the free dictionary
Jump to navigation Jump to search

English[edit]

Etymology[edit]

Named after Jakob Steiner.

Noun[edit]

Steiner tree (plural Steiner trees)

  1. (graph theory) The minimum-weight connected subgraph of a graph that includes all the vertices of that graph.
Retrieved from "https://en.wiktionary.org/w/index.php?title=Steiner_tree&oldid=44267430"