"On the Worst Case of a Minimal Spanning Tree Algorithm for Euclidean Space."

Jyrki Katajainen (1983)

> Home

Details and statistics

DOI: 10.1007/BF01937321

access: closed

type: Journal Article

metadata version: 2021-06-22

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/bit/Katajainen83
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/bit/Katajainen83
Jyrki Katajainen:
On the Worst Case of a Minimal Spanning Tree Algorithm for Euclidean Space. BIT 23(1): 1-8 (1983)

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.