scientific article
From MaRDI portal
Publication:4037435
zbMath0764.68066MaRDI QIDQ4037435
Publication date: 18 May 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
offline algorithmsmaintaining a minimum spanning treeoffline geometric MST problem for a planar point set
Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
Dynamic Euclidean minimum spanning trees and extrema of binary functions ⋮ Average case analysis of dynamic geometric optimization ⋮ Finding the \(k\) smallest spanning trees ⋮ Approximating multistage matching problems ⋮ Approximating multistage matching problems