\(\DeclarePairedDelimiterX{\Set}[2]{\{}{\}}{#1 \nonscript\;\delimsize\vert\nonscript\; #2}\) \( \DeclarePairedDelimiter{\set}{\{}{\}}\) \( \DeclarePairedDelimiter{\parens}{\left(}{\right)}\) \(\DeclarePairedDelimiterX{\innerproduct}[1]{\langle}{\rangle}{#1}\) \(\newcommand{\ip}[1]{\innerproduct{#1}}\) \(\newcommand{\bmat}[1]{\left[\hspace{2.0pt}\begin{matrix}#1\end{matrix}\hspace{2.0pt}\right]}\) \(\newcommand{\barray}[1]{\left[\hspace{2.0pt}\begin{matrix}#1\end{matrix}\hspace{2.0pt}\right]}\) \(\newcommand{\mat}[1]{\begin{matrix}#1\end{matrix}}\) \(\newcommand{\pmat}[1]{\begin{pmatrix}#1\end{pmatrix}}\) \(\newcommand{\mathword}[1]{\mathop{\textup{#1}}}\)
Needs:
Spanning Trees ›
Optimizers ›
Weighted Graphs ›
Needed by:
Optimal Tree Distribution Approximators ›
Links:
Sheet PDF ›
Graph PDF ›

Optimal Spanning Trees

Why

Trees have the fewest edges of any connected graph. Among spanning trees of a weighted graph, can we find the one for which the sum of weights on the edges is minimal.

Why

A minimal spanning tree is a spanning tree whose weight is minimal among all spanning trees. A maximal spanning tree is a spanning tree whose weight is maximal among all spanning trees.

Copyright © 2023 The Bourbaki Authors — All rights reserved — Version 13a6779cc — About — Show the old page view