On minimum spanning trees for random Euclidean bipartite graphs

Mario Correddu, Dario Trevisan. On minimum spanning trees for random Euclidean bipartite graphs. Combinatorics, Probability & Computing, 33(3):319-350, 2024. [doi]

Abstract

Abstract is missing.