scientific article; zbMATH DE number 1436136

MaRDI QIDQ4948733zbMATH OpenFDO

Authors Drago Krznaric, Bengt J. Nilsson, Christos Levcopoulos

Publication date 26 April 2000

zbMATH Keywords

computational geometry

Mathematics Subject Classification ID

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

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

Cited in

(36)

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

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)