How to Pack Trees

DOI10.1006/JAGM.1999.1014MaRDI QIDQ4264490zbMATH OpenOpenAlexFDO

Authors Joseph (Yossi) Gil, Alon Itai

Publication date 22 September 1999

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jagm.1999.1014

zbMATH Keywords

virtual memory system

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Dynamic programming (90C39)

Recommendations

• Packing trees
• scientific article; zbMATH DE number 1947390
• Memory management for B-trees
• Cache-Oblivious B-Trees
• Optimal mappings of \(q\)-ary and binomial trees into parallel memory modules for fast and conflict-free access to path and subtree templates

Cited in

(10)

• Data replication in static tree structures
• Packing in trees
• How to pack directed acyclic graphs into small blocks
• Worst-case optimal tree layout in external memory
• Succinct and I/O efficient data structures for traversal in trees
• The hardness of data packing
• scientific article; zbMATH DE number 992350 (Why is no real title available?)
• scientific article; zbMATH DE number 1947390 (Why is no real title available?)
• How to fit a tree in a box
• Packing trees

This page was built for publication: How to Pack Trees

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