Skip to search formSkip to main contentSkip to account menu

Kinetic Euclidean minimum spanning tree

A kinetic Euclidean minimum spanning tree is a kinetic data structure that maintains the Euclidean minimum spanning tree (EMST) of a set P of n… 
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2011
2011
This paper presents the first kinetic data structure (KDS) for maintenance of the Euclidean minimum spanning tree (EMST) on a set…