Abstract
An algorithm to generate all maximal independent sets in lexicographic order with polynomial time delay between the output of two successive independent sets was proposed by Johnson. This algorithm needs an exponential amount of space. Johnson suggested an open problem, which is to find such an algorithm with polynomial time delay and space needed between the output of two successive maximal independent sets. In this paper, we try to investigate this problem on trees. We first introduce a new problem—the constrained maximal independent set problem, which is NP-complete for general graphs. We show that, for trees, the constrained maximal independent set problem can be solved in θ( n) time, where n is the number of vertices. Based upon this algorithm, we propose another algorithm that generates all maximal independent sets in lexicographic order with O( n 2) delay between the output of any two successive independent sets with O( n) space for trees. In other words, we partially solve Johnson's open problem.
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.
