scientific article; zbMATH DE number 1145903

MaRDI QIDQ4386069zbMATH OpenFDO

Authors James A. Foster, Paul Oman, Karen van Houten

Publication date 14 September 1998

zbMATH Keywords

algorithmsbitstring representationBoolean circuitsdata structurejoin treesrandom walks

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• On generating \(k\)-ary trees in computer representation
• Universal Succinct Representations of Trees?
• Succinct representations of trees
• Entropy and optimal compression of some general plane trees
• A New Coding Algorithm for Trees

Cited in

(4)

• Trees with the mos subtrees - an algorithmic approach
• scientific article; zbMATH DE number 3876615 (Why is no real title available?)
• scientific article; zbMATH DE number 1538031 (Why is no real title available?)
• Efficient Schemes for Computing α-tree Representations

This page was built for publication:

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