Testing Euclidean minimum spanning trees in the plane

DOI10.1145/1367064.1367071zbMath1445.68341OpenAlexW1965045148MaRDI QIDQ4962736

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

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

Related Items (1)

Lower bounds for testing Euclidean minimum spanning trees

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