Skip to main content
SpringerLink
Log in

Output-Polynomial Enumeration of All Fixed-Cardinality Ideals of a Poset, Respectively All Fixed-Cardinality Subtrees of a Tree

  • Published:
Order Aims and scope Submit manuscript

Abstract

The N cardinality k ideals of any w-element poset (k ≤ w fixed) can be enumerated in time O(Nw 3). The corresponding bound for k-element subtrees of a w-element tree is O(Nw 5). An algorithm is described that by the use of wildcards displays all order ideals of a poset in a compact manner, i.e. not one by one.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Berman, J., Köhler, P.: Cardinalities of finite distributive lattices. Mitt. Math. Sem. Giessen 121, 103–124 (1976)

    Google Scholar 

  2. Caspard, N., Leclerc, B., Monjardet, B.: Finite ordered sets. In: Encyclopedia Math. and Appl., vol. 144. Cambridge University Press (2012)

  3. Conflitti, A.: On Whitney numbers of the order ideals of generalized fences and crowns. Discrete Math. 309, 615–621 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  4. Edelman, P.H., Jamison, R.E.: The theory of convex geometries. Geom. Dedicata 19, 247–270 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  5. Faigle, U., Kern, W.: Computational complexity of some maximum average weight problems with precedence constraints. Oper. Res. 42, 688–693 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  6. Gusfield, D., Irwing, R.W.: The Stable Marriage Problem: Structure and Algorithms. MIT Press (1989)

  7. Habib, M., Nourine, L., Steiner, G.: Gray codes for the ideals of interval orders. J. Algorithms 25, 52–66 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  8. Knuth, D.: The Art of Computer Programming, vol. 4. Pearson Educ. Inc (2009)

  9. Mannila, H., Räihä, K.J.: The Design of Relational Databases. Addison-Wesley (1992)

  10. Medina, R., Nourine, L.: Algorithme efficace de génération des ideaux d’un ensemble ordonné. C.R. Acad. Sci. Paris Sér. I Math 319, 1115–1120 (1994)

    MATH  MathSciNet  Google Scholar 

  11. Ruskey, F.: Listing and counting subtrees of a tree. SIAM J. Comput. 10, 141–150 (1981)

    Article  MATH  MathSciNet  Google Scholar 

  12. Semegni, Y., Wild, M.: Lattices freely generated by posets within a variety. Part II: Finitely generated varieties. Cornell University Library (2010). arXiv:1007.1643

  13. Steiner, G.: On estimating the number of order ideals in partial orders, with some applications. J. Stat. Plan. Infer. 34, 281–290 (1993)

    Article  MATH  Google Scholar 

  14. Wild, M.: Revisiting the enumeration of all models of a boolean 2-CNF. Cornell University Library (2012). arXiv:1208.2559

  15. Wild, M.: Incidence algebras that are uniquely determined by their zero-nonzero matrix pattern. Linear Algebra Appl. 430, 1007–1016 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  16. Wild, M.: Compactly generating all satisfying truth assignments of a horn formula. J. Satisf. Boolean Model. Comput. 8, 63–82 (2012)

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Stellenbosch, Cape Town Area, Stellenbosch, South Africa

    Marcel Wild

Authors
  1. Marcel Wild
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Marcel Wild.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wild, M. Output-Polynomial Enumeration of All Fixed-Cardinality Ideals of a Poset, Respectively All Fixed-Cardinality Subtrees of a Tree. Order 31, 121–135 (2014). https://doi.org/10.1007/s11083-013-9292-6

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11083-013-9292-6

Keywords

Search

Navigation