Keywords: data structure, priority queue, succinct data structure, experimental evaluationPublished in RUP: 02.12.2020; Views: 1283; Downloads: 17 Link to full text
Abstract: A new simple algorithm for optimal embedding of complete binary trees into hypercubes as well as a node-by-node algorithm for embedding of nearly complete binary trees into hypercubes are presented.Keywords: succinct, data structuresPublished in RUP: 15.10.2013; Views: 3900; Downloads: 78 Link to full text