scientific article; zbMATH DE number 1436136

zbMATH Open0942.68103MaRDI QIDQ4948733FDOQ4948733

Authors: Drago Krznaric, Bengt J. Nilsson, Christos Levcopoulos 

Publication date: 26 April 2000

Title of this publication is not available (Why is that?)

Recommendations

• Minimum spanning trees in \(d\) dimensions
• Minimum Spanning Trees in k-Dimensional Space
• On constructing minimum spanning trees in \(R_ 1^ k\)
• Geometric minimum spanning trees via well-separated pair decompositions
• TREE-WEIGHTED NEIGHBORS AND GEOMETRIC k SMALLEST SPANNING TREES

zbMATH Keywords

computational geometry

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05)

Cited In (32)

• On Closest Pair in Euclidean Metric: Monochromatic is as Hard as Bichromatic
• Reconstructing a minimum spanning tree after deletion of any node
• Title not available (Why is that?)
• Approximating the minimum weight spanning tree of a set of points in the Hausdorff metric
• The vertex degrees of minimum spanning trees
• SINGLE-SOURCE DILATION-BOUNDED MINIMUM SPANNING TREES
• An algorithm for geometric minimum spanning trees requiring nearly linear expected time
• Title not available (Why is that?)
• Transitions in geometric minimum spanning trees
• Computing a \((1+\varepsilon)\)-approximate geometric minimum-diameter spanning tree
• Depth functions and mutidimensional medians on minimal spanning trees
• The minimal spanning tree and the upper box dimension
• Low-degree minimum spanning trees
• On recursive computation of minimum spanning trees for special partial graphs
• The saga of minimum spanning trees
• A low arithmetic-degree algorithm for computing proximity graphs
• The computational complexity of the \(k\)-minimum spanning tree problem in graded matrices
• Minimum spanning trees in \(d\) dimensions
• Title not available (Why is that?)
• Euclidean minimum spanning trees and bichromatic closest pairs
• Minimum Spanning Trees in k-Dimensional Space
• Efficient minimum spanning tree construction with Delaynay triangulation
• Minimal spanning trees and Stein's method
• Dynamic Euclidean minimum spanning trees and extrema of binary functions
• An optimal-time algorithm for shortest paths on a convex polytope in three dimensions
• Title not available (Why is that?)
• Title not available (Why is that?)
• Farthest neighbors, maximum spanning trees and related problems in higher dimensions
• Geometric minimum spanning trees via well-separated pair decompositions
• ``Minimax length links of a dissimilarity matrix and minimum spanning trees
• Title not available (Why is that?)
• Testing Euclidean minimum spanning trees in the plane

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4948733)