Generalized Polychotomic Encoding: A Very Short Bit-Vector Encoding of Tree Hierarchies

DOI10.1007/978-3-540-87477-5_9zbMath1160.90702OpenAlexW1600130935MaRDI QIDQ3627677

Olivier Raynaud, Pierre Colomb, Éric Thierry

Publication date: 13 May 2009

Published in: Communications in Computer and Information Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-87477-5_9

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59)

Related Items (1)

The Secret Life of Keys: On the Calculation of Mechanical Lock Systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On locally presented posets
• Degrees of freedom versus dimension for containment orders
• An improved algorithm for transitive closure on acyclic digraphs
• Geometric containment orders: A survey
• Computational aspects of the 2-dimension of partially ordered sets
• An Efficient Data Structure for Lattice Operations

This page was built for publication: Generalized Polychotomic Encoding: A Very Short Bit-Vector Encoding of Tree Hierarchies