A framework for algorithm stability and its application to kinetic Euclidean MSTs
From MaRDI portal
Publication:2294738
DOI10.1007/978-3-319-77404-6_58zbMath1504.68301OpenAlexW2789434076WikidataQ59782216 ScholiaQ59782216MaRDI QIDQ2294738
Kevin Verbeek, Wouter Meulemans, Bettina Speckmann, Jules Wulms
Publication date: 12 February 2020
Full work available at URL: https://research.tue.nl/nl/publications/bde45eae-314a-42b4-8dca-9a0a420f38e1
Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Data structures (68P05)
Related Items (6)
The Minimum Moving Spanning Tree Problem ⋮ The minimum moving spanning tree problem ⋮ Voronoi Diagram and Delaunay Triangulation with Independent and Dependent Geometric Uncertainties ⋮ Topological stability of kinetic \(k\)-centers ⋮ Average Sensitivity of Graph Algorithms ⋮ Euclidean minimum spanning trees with independent and dependent geometric uncertainties
This page was built for publication: A framework for algorithm stability and its application to kinetic Euclidean MSTs
