On minimum spanning trees for random Euclidean bipartite graphs

From MaRDI portal
Publication:6632808

DOI10.1017/S0963548323000445MaRDI QIDQ6632808

Dario Trevisan, Mario Correddu

Publication date: 5 November 2024

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)





Could not fetch data.


Cites Work







This page was built for publication: On minimum spanning trees for random Euclidean bipartite graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6632808)