Generating all maximal independent sets: NP-hardness and polynomial-time algorithms : (preprint)

Additional Metadata
Publisher	Stichting Mathematisch Centrum
Series	Stichting Mathematisch Centrum. Mathematische Besliskunde
Citation APA Style AAA Style APA Style Cell Style Chicago Style Harvard Style IEEE Style MLA Style Nature Style Vancouver Style American-Institute-of-Physics Style Council-of-Science-Editors Style BibTex Format Endnote Format RIS Format CSL Format DOIs only Format	Lawler, E. L., Lenstra, J. K., & Rinnooy Kan, A. H. G. (1978). Generating all maximal independent sets: NP-hardness and polynomial-time algorithms : (preprint). Stichting Mathematisch Centrum. Mathematische Besliskunde. Stichting Mathematisch Centrum.

Publication