The Enumeration of Maximal Cliques of Large Graphs
- 1 March 1973
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 2 (1) , 1-6
- https://doi.org/10.1137/0202001
Abstract
No abstract availableThis publication has 4 references indexed in Scilit:
- Corrections to Bierstone's Algorithm for Generating CliquesJournal of the ACM, 1972
- Scheduling university course examinations by computerCommunications of the ACM, 1967
- 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