A new backtracking algorithm for generating the family of maximal independent sets of a graph
- 1 January 1983
- journal article
- Published by Elsevier in Computers & Mathematics with Applications
- Vol. 9 (4) , 583-589
- https://doi.org/10.1016/0898-1221(83)90115-3
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- A depth first search algorithm to generate the family of maximal independent sets of a graph lexicographicallyComputing, 1981
- Generating All Maximal Independent Sets: NP-Hardness and Polynomial-Time AlgorithmsSIAM Journal on Computing, 1980
- Clique detection for nondirected graphs: Two new algorithmsComputing, 1979
- A note on the complexity of the chromatic number problemInformation Processing Letters, 1976
- An Algorithm for the Chromatic Number of a GraphJournal of the ACM, 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 algorithm for the chromatic number of a graphThe Computer Journal, 1971
- An Analysis of Some Graph Theoretical Cluster TechniquesJournal of the ACM, 1970
- Derivation of Maximal Compatibles Using Boolean AlgebraIBM Journal of Research and Development, 1964