Storage representations for tree-like data structures

DOI10.1007/BF01744292zbMath0437.68013MaRDI QIDQ3878744

Arnold L. Rosenberg, Derick Wood, Zvi Galil

Publication date: 1979

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

zbMATH Keywords

guest graphhost graphdata encodingtree-like data structuresusage pattern

Mathematics Subject Classification ID

Data structures (68P05)

Related Items (3)

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

Cites Work

• Data encodings and their costs
• Preserving Proximity in Arrays
• Space and Time Hierarchies for Classes of Control Structures and Data Structures
• Preserving average proximity in arrays
• Bounds on the costs of data encodings
• Optimal numberings and isoperimetric problems on graphs
• Optimal Assignments of Numbers to Vertices
• Unnamed Item
• Unnamed Item

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