(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...

Full description

Saved in:
Bibliographic Details
Published in:Relatório técnico NCE
Main Authors: Markenzon, Lilian, Pires, Oswaldo Vernet de Souza, Pereira, Paulo Renato C
Format: Relatório
Language:Inglês
Published: Brasil 2005-12-31
Subjects:
Estruturas de dados k-trees
CNPQ::CIENCIAS EXATAS E DA TERRA::CIENCIA DA COMPUTACAO
Online Access:http://hdl.handle.net/11422/1925
Tags: Add Tag
No Tags, Be the first to tag this record!

Similar Items