Storage representations for tree-like data structures

DOI10.1007/BF01744292MaRDI QIDQ3878744zbMATH OpenFDO

Authors Arnold L. Rosenberg, D. Wood, Zvi Galil

Publication date 1979

Published in Mathematical Systems Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01744292

zbMATH Keywords

guest graphhost graphdata encodingtree-like data structuresusage pattern

Mathematics Subject Classification ID

Data structures (68P05)

Cites work

• scientific article; zbMATH DE number 3648730 (Why is no real title available?)
• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• Bounds on the costs of data encodings
• Data encodings and their costs
• Optimal Assignments of Numbers to Vertices
• Optimal numberings and isoperimetric problems on graphs
• Preserving Proximity in Arrays
• Preserving average proximity in arrays
• Space and Time Hierarchies for Classes of Control Structures and Data Structures

Cited in

(3)

• Encoding search trees in lists^†
• On efficient entreeings
• Minimal storage representations for binary relations

This page was built for publication: Storage representations for tree-like data structures

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