Opis: 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.Ključne besede: succinct, data structuresObjavljeno v RUP: 15.10.2013; Ogledov: 4439; Prenosov: 78 Povezava na celotno besedilo