Time-space trade-offs for computing Euclidean minimum spanning trees

DOI10.1007/978-3-319-77404-6_9zbMath1485.68258arXiv1712.06431OpenAlexW2962750386MaRDI QIDQ2294682

Luis Barba, Wolfgang Mulzer, Bahareh Banyassady

Publication date: 12 February 2020

Full work available at URL: https://arxiv.org/abs/1712.06431

zbMATH Keywords

Euclidean minimum spanning treeKruskal's algorithmtime-space trade-offrelative neighborhood graphlimited workspace model

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (1)

A new balanced subdivision of a simple polygon for time-space trade-off algorithms

This page was built for publication: Time-space trade-offs for computing Euclidean minimum spanning trees