Efficient representation of taxonomies

  • G. Gambosi
  • J. Nešetřil
  • M. Talamo
Session CAAP 6 Foundations
Part of the Lecture Notes in Computer Science book series (LNCS, volume 249)


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?".


Partial Order Rooted Tree Linear Extension Transitive Closure Maximal Chain 
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.


  1. [DM]
    B. Dushnik, E. Miller: Partially ordered sets, Amer. J. Math. 63 (1941), 600–610.Google Scholar
  2. [GNT]
    G. Gambosi, J. Nešetřil, M. Talamo: On locally presented posets, submitted to "Theoretical Computer Science".Google Scholar
  3. [KT]
    D. Kelly, W.T. Trotter: Dimension theory for ordered sets in Ordered sets, (I. Rival ed.), D. Reidel, Dordrecht, 171–211.Google Scholar
  4. [R]
    I. Rival: Linear extensions of finite ordered sets, Annals of Discrete Math. 23 (1984), 355–370.Google Scholar
  5. [TM]
    W.T. Trotter, J.I. Moore: Some theorems on graphs and posets, Discrete Math. 15 (1976), 79–84.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1987

Authors and Affiliations

  • G. Gambosi
    • 1
  • J. Nešetřil
    • 2
  • M. Talamo
    • 1
  1. 1.Istituto di Analisi dei Sistemi ed Informatica del C.N.R.RomaItaly
  2. 2.Charles University Malostranské Namesti 25PragueCzechoslovakia

Personalised recommendations