Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 205,823,524 papers from all fields of science
Search
Sign In
Create Free Account
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
Create Alert
Alert
Related topics
Related topics
3 relations
Kinetic data structure
Minimum spanning tree
Planar graph
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
Kinetic Euclidean minimum spanning tree in the plane
Zahed Rahmati
,
Alireza Zarei
J. Discrete Algorithms
2012
Corpus ID: 12225368
2011
2011
Kinetic Euclidean Minimum Spanning Tree in the Plane
Zahed Rahmati
,
Alireza Zarei
IWOCA
2011
Corpus ID: 40944371
This paper presents the first kinetic data structure (KDS) for maintenance of the Euclidean minimum spanning tree (EMST) on a set…
Expand
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