A minimal spanning tree algorithm for a point set in Euclidean space

Research output: Working paper › Research

Standard

A minimal spanning tree algorithm for a point set in Euclidean space. / Ernvall, J.; Katajainen, J.; Nevalainen, O.

1980.

Research output: Working paper › Research

Harvard

Ernvall, J, Katajainen, J & Nevalainen, O 1980 'A minimal spanning tree algorithm for a point set in Euclidean space'.

APA

Ernvall, J., Katajainen, J., & Nevalainen, O. (1980). A minimal spanning tree algorithm for a point set in Euclidean space.

Vancouver

Ernvall J, Katajainen J, Nevalainen O. A minimal spanning tree algorithm for a point set in Euclidean space. 1980.

Author

Ernvall, J. ; Katajainen, J. ; Nevalainen, O. / A minimal spanning tree algorithm for a point set in Euclidean space. 1980.

Bibtex

@techreport{65e9466005c011deb05e000ea68e967b,
title = "A minimal spanning tree algorithm for a point set in Euclidean space",
author = "J. Ernvall and J. Katajainen and O. Nevalainen",
year = "1980",
language = "English",
type = "WorkingPaper",

}

RIS

TY - UNPB

T1 - A minimal spanning tree algorithm for a point set in Euclidean space

AU - Ernvall, J.

AU - Katajainen, J.

AU - Nevalainen, O.

PY - 1980

Y1 - 1980

M3 - Working paper

BT - A minimal spanning tree algorithm for a point set in Euclidean space

ER -

ID: 10922954