最終更新日：2024/08/03

(graph theory) The minimum-weight connected subgraph of a graph that includes all the vertices of that graph.

正解を見る

Steiner tree

問題を編集する

元となった辞書の項目

Steiner tree

noun

(graph theory) The minimum-weight connected subgraph of a graph that includes all the vertices of that graph.

The Steiner tree problem is a well-known optimization problem in graph theory.

意味（1）

(graph theory) The minimum-weight connected subgraph of a graph that includes all the vertices of that graph.