Generalized Polychotomic Encoding: A Very Short Bit-Vector Encoding of Tree Hierarchies
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 2089399 (Why is no real title available?)
- scientific article; zbMATH DE number 3887060 (Why is no real title available?)
- scientific article; zbMATH DE number 53952 (Why is no real title available?)
- scientific article; zbMATH DE number 1016362 (Why is no real title available?)
- scientific article; zbMATH DE number 1554937 (Why is no real title available?)
- An Efficient Data Structure for Lattice Operations
- An improved algorithm for transitive closure on acyclic digraphs
- Computational aspects of the 2-dimension of partially ordered sets
- Degrees of freedom versus dimension for containment orders
- Geometric containment orders: A survey
- On locally presented posets
Cited in
(6)- The secret life of keys: on the calculation of mechanical lock systems
- Generalized Huffman coding for binary trees with choosable edge lengths
- scientific article; zbMATH DE number 2089399 (Why is no real title available?)
- scientific article; zbMATH DE number 1554928 (Why is no real title available?)
- The complexity of embedding orders into small products of chains
- Computational aspects of the 2-dimension of partially ordered sets
This page was built for publication: Generalized Polychotomic Encoding: A Very Short Bit-Vector Encoding of Tree Hierarchies
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3627677)