Encoding Data Structures in Trees

DOI10.1145/322154.322160zbMath0423.68003OpenAlexW2093107107MaRDI QIDQ3857699

Arnold L. Rosenberg

Publication date: 1979

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/322154.322160

zbMATH Keywords

graph embeddingsstorage structuredata encodingscost measurescomplexity of data representationrepresenting data structures by graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05)

Related Items (13)

The complexity of minimizing wire lengths in VLSI layouts ⋮ Minimum-perimeter domain assignment ⋮ A new combinatorial approach to optimal embeddings of rectangles ⋮ Blocking for external graph searching ⋮ Uniform data encodings ⋮ On the k-ary hypercube ⋮ On the complexity of tree embedding problems ⋮ A comparison of two methods of encoding arrays ⋮ A note on paths embedded in trees ⋮ On computing distances between leaves in a complete tree ⋮ Minimal storage representations for binary relations ⋮ Encoding search trees in lists^† ⋮ On efficient entreeings

This page was built for publication: Encoding Data Structures in Trees