"On minimum spanning trees for random Euclidean bipartite graphs."

Mario Correddu, Dario Trevisan (2024)

> Home

Details and statistics

DOI: 10.1017/S0963548323000445

access: closed

type: Journal Article

metadata version: 2024-05-07

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/cpc/CorredduT24
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cpc/CorredduT24
Mario Correddu, Dario Trevisan:
On minimum spanning trees for random Euclidean bipartite graphs. Comb. Probab. Comput. 33(3): 319-350 (2024)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.