Cargando...
(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...
Guardado en:
| Publicado en: | Relatório técnico NCE |
|---|---|
| Autores principales: | , , |
| Formato: | Relatório |
| Lenguaje: | Inglês |
| Publicado: |
Brasil
2005-12-31
|
| Materias: | |
| Acceso en línea: | http://hdl.handle.net/11422/1925 |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|