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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
