On generating all maximal independent sets

Information Processing Letters

Volumn 27, Issue 3, 1988, Pages 119-123

  Johnson, David S ^a   Yannakakis, Mihalis ^a   Papadimitriou, Christos H ^b  

^a LUCENT TECHNOLOGIES   (United States)

^b STANFORD UNIVERSITY   (United States)

Author keywords

enumeration; Independent set; lexicographic order; NP complete; polynomial time

Indexed keywords

COMPUTER PROGRAMMING - ALGORITHMS;

ENUMERATION; LEXICOGRAPHIC ORDER; MAXIMAL INDEPENDENT SETS; NP-COMPLETE; POLYNOMIAL DELAY;

MATHEMATICAL TECHNIQUES;

EID: 0023978535     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/0020-0190(88)90065-8     Document Type: Article

References (8)

1. Sorting the Cartesian product
2. How to assign votes in a distributed system
3. Generating all maximal independent sets NP-hardness and polynomial-time algorithms
4. Minimizing the number of states in incompletely specified sequential switching functions
5. Every one a winner, or how to avoid isomorphism when cataloguing combinatorial configurations
6. Bounds on backtrack algorithms for listing cycles, paths, and spanning trees
7. A new algorithm for generating all maximal independent sets