Generating All Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms
- 1 August 1980
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 9 (3) , 558-565
- https://doi.org/10.1137/0209042
Abstract
No abstract availableThis publication has 5 references indexed in Scilit:
- 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
- A Functional Equation and its Application to Resource Allocation and Sequencing ProblemsManagement Science, 1969
- Minimizing the Number of States in Incompletely Specified Sequential Switching FunctionsIEEE Transactions on Electronic Computers, 1959