Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Related topics

Related topics

3 relations
Kinetic data structureMinimum spanning treePlanar graph

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
Kinetic Euclidean minimum spanning tree in the plane
This paper presents a kinetic data structure (KDS) for maintenance of the Euclidean minimum spanning tree (EMST) on a set of… Expand
Is this relevant?
2011
2011
Kinetic Euclidean Minimum Spanning Tree in the Plane
This paper presents the first kinetic data structure (KDS) for maintenance of the Euclidean minimum spanning tree (EMST) on a set… Expand
Is this relevant?
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE