z-logo
Premium
On implicit data structures for priority queues
Author(s) -
Perko A.
Publication year - 1985
Publication title -
software: practice and experience
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.437
H-Index - 70
eISSN - 1097-024X
pISSN - 0038-0644
DOI - 10.1002/spe.4380150105
Subject(s) - queue , computer science , data structure , priority queue , simple (philosophy) , programming language , philosophy , epistemology
Certain implicit data structures for priority queues are implemented and compared with a simple linked structure. Timing experiments show that implicit structures are rather slow.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom