MIXED SPANNING TREES IN THEORY AND PRACTICE

DOI10.1142/S0218195999000194zbMath0949.68153OpenAlexW2107691209MaRDI QIDQ4949992

Jeffrey S. Salowe, D. S. Richards

Publication date: 7 May 2000

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218195999000194

zbMATH Keywords

mixed spanning tree

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• Delaunay graphs are almost as good as complete graphs
• An O(n log n) algorithm for the all-nearest-neighbors problem
• A sparse graph almost as good as the complete graph on points in \(k\) dimensions
• Balancing minimum spanning trees and shortest-path trees
• CONSTRUCTING MULTIDIMENSIONAL SPANNER GRAPHS
• Covering a sphere with spheres

This page was built for publication: MIXED SPANNING TREES IN THEORY AND PRACTICE