The expected value of random minimal length spanning tree of a complete graph
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
The Expected Length of a Minimal Spanning Tree of a Cylinder Graph
Combinatorics, Probability and Computing
On the difference of expected lengths of minimum spanning trees
Combinatorics, Probability and Computing
Approximating the statistics of various properties in randomly weighted graphs
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Hi-index | 0.04 |