A New Algorithm for Generating All the Maximal Independent Sets
- 1 September 1977
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 6 (3) , 505-517
- https://doi.org/10.1137/0206036
Abstract
No abstract availableThis publication has 7 references indexed in Scilit:
- Clique Detection Algorithms Based on Line Addition and Line RemovalSIAM Journal on Applied Mathematics, 1974
- Algorithm 457: finding all cliques of an undirected graphCommunications of the ACM, 1973
- The Enumeration of Maximal Cliques of Large GraphsSIAM Journal on Computing, 1973
- An Analysis of Some Graph Theoretical Cluster TechniquesJournal of the ACM, 1970
- On cliques in graphsIsrael Journal of Mathematics, 1965
- Derivation of Maximal Compatibles Using Boolean AlgebraIBM Journal of Research and Development, 1964
- Minimizing the Number of States in Incompletely Specified Sequential Switching FunctionsIEEE Transactions on Electronic Computers, 1959