Abstract
Generating the ideals of a partially ordered set is an important, frequently occurring problem in scheduling, reliability, sensitivity analysis for network flows and other combinatorial optimization problems. In this paper we present an algorithm which generates all the ideals of a partial order on n elements in O( n) time per ideal.
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.
