Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:00445455n
Noun Concept
SYL
No term available
EN
In mathematics, a random minimum spanning tree may be formed by assigning random weights from some distribution to the edges of an undirected graph, and then constructing the minimum spanning tree of the graph. Wikipedia
Relations
Sources
IS A
EN
spanning tree
STUDIED BY
EN
combinatorics

Please note that, in order to improve your browsing experience on this website, BabelNet® uses various types of cookies, including: browsing functionality, performance and statistical cookies.

By continuing to browse the site you are agreeing to our use of cookies. OK

License