Computing Euclidean maximum spanning trees

DOI10.1007/BF01840396zbMath0696.68066MaRDI QIDQ911288

Subhash Suri, Michael S. Paterson, Frances F. Yao, Clyde l. Monma

Publication date: 1990

Published in: Algorithmica (Search for Journal in Brave)

zbMATH Keywords

clustersspanning treesdiameter-partitioningfurthest-neighbor graph

Mathematics Subject Classification ID

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

Related Items (11)

Geometric clustering in normed planes ⋮ On minimum and maximum spanning trees of linearly moving points ⋮ Average case analysis of dynamic geometric optimization ⋮ Piercing diametral disks induced by edges of maximum spanning trees ⋮ How to find Steiner minimal trees in Euclidean \(d\)-space ⋮ Farthest neighbors, maximum spanning trees and related problems in higher dimensions ⋮ Transitions in geometric minimum spanning trees ⋮ Spanning trees in multipartite geometric graphs ⋮ Maximum plane trees in multipartite geometric graphs ⋮ Maximum spanning trees in normed planes ⋮ On the longest spanning tree with neighborhoods

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Diameter partitioning
• Geometric applications of a matrix-searching algorithm
• Hierarchical clustering schemes
• How to search in history
• The Ultimate Planar Convex Hull Algorithm?
• On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems
• On the History of the Minimum Spanning Tree Problem
• The NP-completeness column: An ongoing guide

This page was built for publication: Computing Euclidean maximum spanning trees