A depth first search algorithm to generate the family of maximal independent sets of a graph lexicographically
- 1 December 1981
- journal article
- Published by Springer Nature in Computing
- Vol. 27 (4) , 349-366
- https://doi.org/10.1007/bf02277184
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Generating All Maximal Independent Sets: NP-Hardness and Polynomial-Time AlgorithmsSIAM Journal on Computing, 1980
- Clique detection for nondirected graphs: Two new algorithmsComputing, 1979
- 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
- Corrections to Bierstone's Algorithm for Generating CliquesJournal of the ACM, 1972
- An Analysis of Some Graph Theoretical Cluster TechniquesJournal of the ACM, 1970
- Maximum internally stable sets of a graphJournal of Mathematical Analysis and Applications, 1969
- On cliques in graphsIsrael Journal of Mathematics, 1965
- A Procedure for Clique Detection Using the Group MatrixSociometry, 1957