Abstract
A bit-vector encoding is a well known method for representing hierarchies (i.e. partially ordered sets). This encoding corresponds to an embedding of a given hierarchy into a Boolean lattice whose dimension is the encoding’s size. Computing an optimal bit-vector encoding, which size is called the 2-dimension, is an \(\mathcal {N}\mathcal {P}\)-hard problem. Hence, many algorithms were designed to provide good bit-vector encoding. In this paper, we study tree hierarchies. We analyse previous algorithms for their bit-vector encoding then we point out their common strategy that led us to design a new algorithm improving all the previous ones.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Caseau, Y.: Efficient handling of multiple inheritance hierarchies. In: Proceedings of OOPSLA (1993)
Caseau, Y., Habib, M., Nourine, L., Raynaud, O.: Encoding of Multiple Inheritance Hierarchies. Computational Intelligence (1999)
Colomb, P., Raynaud, O., Thierry, E.: Generalized polychotomic encoding: a very short bit-vector encoding of tree hierarchies. In: MCO (2008)
Fall, A.: The Foundations of Taxonomic Encodings. Computational Intelligence (1998)
Filman, R.E.: Polychotomic encoding: a better quasi-optimal bit-vector encoding of tree hierarchies. In: Proceedings of ECOOP (2002)
Habib, M., Nourine, L., Raynaud, O., Thierry, E.: Computationel aspects of the 2-dimension of partially ordered sets. Theor. Comput. Sci. (2004)
Habib, M., Nourine, L.: Bit-vector encoding for partially ordered sets. In: Proceedings of the International Workshop on Orders, Algorithms, and Applications (1994)
Krall, A., Vitek, J., Horspool, R.N.: Near optimal hierarchical encoding of types. In: Proceedings of Ecoop (1997)
Raynaud, O., Thierry, E.: A quasi optimal bit-vector encoding of tree hierarchies. In: Proceedings of ECOOP 2001 Application to Efficient Type Inclusion Tests (2001)
Sperner, E.: Ein satz uber untermengen einer endlichen menge. Math. Z (1928)
Trotter, W.T.: Embedding finite posets in cubes. Discret. Math. (1975)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Ghazi, K., Beaudou, L., Raynaud, O. (2019). Algorithms for a Bit-Vector Encoding of Trees. In: Vasant, P., Zelinka, I., Weber, GW. (eds) Intelligent Computing & Optimization. ICO 2018. Advances in Intelligent Systems and Computing, vol 866. Springer, Cham. https://doi.org/10.1007/978-3-030-00979-3_44
Download citation
DOI: https://doi.org/10.1007/978-3-030-00979-3_44
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-00978-6
Online ISBN: 978-3-030-00979-3
eBook Packages: EngineeringEngineering (R0)