Encoding Data Structures in Trees

DOI10.1145/322154.322160MaRDI QIDQ3857699zbMATH OpenOpenAlexFDO

Authors 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)

Cited in

(13)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3857699)