




















The weight of the minimum spanning tree in a complete weighted graph with random edge weights is a well-known problem. For various classes of distributions, it is proved that the weight of the minimum spanning tree tends to a constant, which can be calculated depending on the distribution. In this paper, we generalise this result to the hypergraphs setting.
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。