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: 4235; Downloads: 78 Link to full text