On generating all maximal independent sets
- 21 March 1988
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 27 (3) , 119-123
- https://doi.org/10.1016/0020-0190(88)90065-8
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- How to assign votes in a distributed systemJournal of the ACM, 1985
- Generating All Maximal Independent Sets: NP-Hardness and Polynomial-Time AlgorithmsSIAM Journal on Computing, 1980
- Every one a Winner or how to Avoid Isomorphism Search when Cataloguing Combinatorial ConfigurationsPublished by Elsevier ,1978
- A New Algorithm for Generating All the Maximal Independent SetsSIAM Journal on Computing, 1977
- Bounds on Backtrack Algorithms for Listing Cycles, Paths, and Spanning TreesNetworks, 1975
- Minimizing the Number of States in Incompletely Specified Sequential Switching FunctionsIEEE Transactions on Electronic Computers, 1959