On the worst case of a minimal spanning tree algorithm for euclidean space
type: Item
instance of: scholarly article
title: On the worst case of a minimal spanning tree algorithm for euclidean space
zbMATH Open document ID: 0505.68029
DOI: 10.1007/BF01937321
author: Jyrki Katajainen
published in: BIT
publication date: 1983-01-01T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 3797181
zbMATH Keywords: 23, 2-8 (1983)
zbMATH Keywords: worst case running time
zbMATH Keywords: minimal spanning tree
MaRDI profile type: Publication
cites work: Fast Algorithms for Constructing Minimal Spanning Trees in Coordinate Spaces
cites work: Finding minimal spanning trees in a Euclidean coordinate space
description: scientific article; zbMATH DE number 3797181