Wird geladen...
(L, U): bounded priority queues and the codification of Rényi k-Trees
We introduce in this paper a data structure named (L, U)- bounded priority queue, which particularizes priority queues in two aspects: the priorities associated to the elements must be integer numbers constrained to a predefined interval and, in a sequence of operations, no more than one Insert can...
Gespeichert in:
| Veröffentlicht in: | Relatório técnico NCE |
|---|---|
| Hauptverfasser: | , , |
| Format: | Relatório |
| Sprache: | Inglês |
| Veröffentlicht: |
Brasil
2005-12-31
|
| Schlagworte: | |
| Online Zugang: | http://hdl.handle.net/11422/1925 |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|