About: Kinetic Euclidean minimum spanning tree

An Entity of Type: Abstraction100002137, from Named Graph: http://dbpedia.org, within Data Space: dbpedia.org

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 points that are moving continuously. For the set of points P in 2-dimensional space, there are two kinetic algorithms for maintenance of the EMST. Abam, Rahmati, and Zarei provide a significant improvement on exact kinetic maintenance on the Euclidean minimum spanning tree. Their kinetic data structure handles a nearly cubic number of events.

Property Value
dbo:abstract
  • 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 points that are moving continuously. For the set of points P in 2-dimensional space, there are two kinetic algorithms for maintenance of the EMST. Rahmati and Zarei build a kinetic data structure based on the to handle updates to the EMST in polylog time per event. Their kinetic data structure handles events, where m is the number of all changes to the Delaunay triangulation of the moving points. Their kinetic approach can work well for maintenance of the minimum spanning tree (MST) of a planar graph whose edge weights are changing as a continuous function of time. Abam, Rahmati, and Zarei provide a significant improvement on exact kinetic maintenance on the Euclidean minimum spanning tree. Their kinetic data structure handles a nearly cubic number of events. (en)
dbo:wikiPageID
  • 37737153 (xsd:integer)
dbo:wikiPageLength
  • 1791 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID
  • 995715930 (xsd:integer)
dbo:wikiPageWikiLink
dbp:wikiPageUsesTemplate
dcterms:subject
rdf:type
rdfs:comment
  • 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 points that are moving continuously. For the set of points P in 2-dimensional space, there are two kinetic algorithms for maintenance of the EMST. Abam, Rahmati, and Zarei provide a significant improvement on exact kinetic maintenance on the Euclidean minimum spanning tree. Their kinetic data structure handles a nearly cubic number of events. (en)
rdfs:label
  • Kinetic Euclidean minimum spanning tree (en)
owl:sameAs
prov:wasDerivedFrom
foaf:isPrimaryTopicOf
is dbo:wikiPageWikiLink of
is foaf:primaryTopic of
Powered by OpenLink Virtuoso    This material is Open Knowledge     W3C Semantic Web Technology     This material is Open Knowledge    Valid XHTML + RDFa
This content was extracted from Wikipedia and is licensed under the Creative Commons Attribution-ShareAlike 3.0 Unported License