Generating all Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms

Eugene L. Lawler, Jan Karel Lenstra, A. H. G. Rinnooy Kan. Generating all Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms. SIAM Journal on Computing, 9(3):558-565, 1980.

Abstract

Abstract is missing.