On the worst case of a minimal spanning tree algorithm for euclidean space

DOI10.1007/BF01937321zbMath0505.68029MaRDI QIDQ1836479

Jyrki Katajainen

Publication date: 1983

Published in: BIT (Search for Journal in Brave)

zbMATH Keywords

minimal spanning treeworst case running time23, 2-8 (1983)

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Related Items (2)

An O(N log N) minimal spanning tree algorithm for N points in the plane ⋮ The central limit theorem for Euclidean minimal spanning trees. I

Cites Work

• Finding minimal spanning trees in a Euclidean coordinate space
• Fast Algorithms for Constructing Minimal Spanning Trees in Coordinate Spaces

This page was built for publication: On the worst case of a minimal spanning tree algorithm for euclidean space