Kinetic tournament
id:
kinetic-tournament-241-12687399
title:
Kinetic tournament
text:
A Kinetic Tournament is a kinetic data structure that functions as a priority queue for elements whose priorities change as a continuous function of time. It is implemented analogously to a "tournament" between elements to determine the "winner", with the certificates enforcing the winner of each "match" in the tournament. It supports the usual priority queue operations - insert, delete and find-max. They are often used as components of other kinetic data structures, such as kinetic closest pair
brand slug:
wiki
category slug:
encyclopedia
description:
Data structure
original url:
https://en.wikipedia.org/wiki/Kinetic_tournament
date created:
date modified:
2023-01-03T18:00:16Z
main entity:
{"identifier":"Q6410804","url":"https://www.wikidata.org/entity/Q6410804"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/5/56/Kinetic_tournament_overview.png","width":392,"height":625}
fields total:
13
integrity:
15