On minimum spanning trees for random Euclidean bipartite graphs.

Mario Correddu Dario Trevisan

Published in: Comb. Probab. Comput. (2024)

Keyphrases

bipartite graph
minimum spanning trees
edge weights
maximum matching
spanning tree
minimum spanning tree
euclidean distance
link prediction
maximum cardinality
supervised learning
euclidean space
feature extraction