Random minimum length spanning trees in regular graphs
From MaRDI portal
Publication:1288911
DOI10.1007/PL00009825zbMath0913.05085WikidataQ57401554 ScholiaQ57401554MaRDI QIDQ1288911
Andrew Beveridge, Colin J. H. McDiarmid, Alan M. Frieze
Publication date: 18 May 1999
Published in: Combinatorica (Search for Journal in Brave)
Related Items
On Edge-Disjoint Spanning Trees in a Randomly Weighted Complete Graph, Component structure of the vacant set induced by a random walk on a random graph, On the Length of a Random Minimum Spanning Tree, On the rank of a random binary matrix, Minimum Cost Matching in a Random Graph with Random Costs, On the Difference of Expected Lengths of Minimum Spanning Trees