Testing Euclidean minimum spanning trees in the plane

DOI10.1145/1367064.1367071MaRDI QIDQ4962736zbMATH OpenOpenAlexFDO

Authors Christian Sohler, Artur Czumaj

Publication date 5 November 2018

Published in ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1367064.1367071

zbMATH Keywords

randomized algorithmsproperty testingEuclidean minimum spanning tree

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Randomized algorithms (68W20) Analysis of algorithms (68W40)

Recommendations

• Lower bounds for testing Euclidean minimum spanning trees
• On the area requirements of Euclidean minimum spanning trees
• On the area requirements of Euclidean minimum spanning trees
• Testing Euclidean Spanners
• Testing Euclidean Spanners
• Minimum spanning trees in d dimensions
• scientific article; zbMATH DE number 1436136
• A fast and simple algorithm for computing approximate Euclidean minimum spanning trees

Cited in

(2)

• Lower bounds for testing Euclidean minimum spanning trees
• Testing Euclidean Spanners

This page was built for publication: Testing Euclidean minimum spanning trees in the plane

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