On constructing minimum spanning trees in R_ 1^ k

DOI10.1007/PL00009170MaRDI QIDQ1361418zbMATH OpenFDO

Authors Sergei Bespamyatnikh

Publication date 12 January 1998

Published in Algorithmica (Search for Journal in Brave)

zbMATH Keywords

minimum spanning tree

Mathematics Subject Classification ID

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

Recommendations

• Minimum Spanning Trees in k-Dimensional Space
• scientific article; zbMATH DE number 1436136
• Minimum spanning trees in d dimensions
• TREE-WEIGHTED NEIGHBORS AND GEOMETRIC k SMALLEST SPANNING TREES

Cited in

(12)

• Finding the k smallest spanning trees
• On recursive computation of minimum spanning trees for special partial graphs
• A note on the $k$-minimum spanning tree problem on circles
• Resistant estimation of multivariate location using minimum spanning trees
• Minimum spanning trees in d dimensions
• Minimum Spanning Trees in k-Dimensional Space
• scientific article; zbMATH DE number 3974972 (Why is no real title available?)
• Finding the \(k\) smallest spanning trees
• Efficient minimum spanning tree construction with Delaynay triangulation
• On the Minimum Number of Spanning Trees ink-Edge-Connected Graphs
• scientific article; zbMATH DE number 3978859 (Why is no real title available?)
• Geometric minimum spanning trees via well-separated pair decompositions

This page was built for publication: On constructing minimum spanning trees in \(R_ 1^ k\)

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