(L, U): bounded priority queues and the codification of Rényi k-Trees

Markenzon, Lilian
Pires, Oswaldo Vernet de Souza
Pereira, Paulo Renato C

Publication date

December 2005

Publisher

Instituto Tércio Pacitti de Aplicações e Pesquisas Computacionais

Abstract

Submitted by Elaine Almeida (elaine.almeida@nce.ufrj.br) on 2017-05-09T14:22:59Z No. of bitstreams: 1 05_05_000643158.pdf: 202695 bytes, checksum: 2829f7a50c66f4d01af5aec9e38d372d (MD5)Made available in DSpace on 2017-05-09T14:22:59Z (GMT). No. of bitstreams: 1 05_05_000643158.pdf: 202695 bytes, checksum: 2829f7a50c66f4d01af5aec9e38d372d (MD5) Previous issue date: 2005-12-31We 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 immediatly follow a DeleteMin. This data structure is used in the d...