Abstract
In this paper, the use of the concepts of dimension and boolean dimension of partial orders is studied for what concerns the efficient representation of taxonomies. Under this approach, labelings of the nodes (linear extensions of partial orders) are used to answer efficiently to such queries as "Is element a related to element b?".
This work was partially supported by the ESPRIT Project ALPES.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
B. Dushnik, E. Miller: Partially ordered sets, Amer. J. Math. 63 (1941), 600–610.
G. Gambosi, J. Nešetřil, M. Talamo: On locally presented posets, submitted to "Theoretical Computer Science".
D. Kelly, W.T. Trotter: Dimension theory for ordered sets in Ordered sets, (I. Rival ed.), D. Reidel, Dordrecht, 171–211.
I. Rival: Linear extensions of finite ordered sets, Annals of Discrete Math. 23 (1984), 355–370.
W.T. Trotter, J.I. Moore: Some theorems on graphs and posets, Discrete Math. 15 (1976), 79–84.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1987 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gambosi, G., Nešetřil, J., Talamo, M. (1987). Efficient representation of taxonomies. In: Ehrig, H., Kowalski, R., Levi, G., Montanari, U. (eds) TAPSOFT '87. CAAP 1987. Lecture Notes in Computer Science, vol 249. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-17660-8_58
Download citation
DOI: https://doi.org/10.1007/3-540-17660-8_58
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-17660-2
Online ISBN: 978-3-540-47746-4
eBook Packages: Springer Book Archive