Finding minimal spanning trees in a Euclidean coordinate space

DOI10.1007/BF01934070zbMath0464.68067MaRDI QIDQ1154282

Jyrki Katajainen, Olli S. Nevalainen, Jarmo Ernvall

Publication date: 1981

Published in: BIT (Search for Journal in Brave)

zbMATH Keywords

algorithmEuclidean spaceEuclidean distanceminimal spanning trees21, 46-54 (1981)multidimensional search trees

Mathematics Subject Classification ID

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

Related Items

An O(N log N) minimal spanning tree algorithm for N points in the plane ⋮ On the worst case of a minimal spanning tree algorithm for euclidean space

Cites Work

• A note on two problems in connexion with graphs
• On the shortest spanning subtree of a graph and the traveling salesman problem
• An \(0(| E|\log\log| V|)\) algorithm for finding minimum spanning trees
• Priority queues with update and finding minimum spanning trees
• Multidimensional binary search trees used for associative searching
• Finding Minimum Spanning Trees
• Fast Algorithms for Constructing Minimal Spanning Trees in Coordinate Spaces
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Finding minimal spanning trees in a Euclidean coordinate space