The Worst-Case Time Complexity for Generating All Maximal Cliques
Authors:
- 1 January 2004
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 161-170
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Protein threading with profiles and constraints2004
- PHYTOPROT: a database of clusters of plant proteinsNucleic Acids Research, 2004
- Development of a Chemical Structure Comparison Method for Integrated Analysis of Chemical and Genomic Information in the Metabolic PathwaysJournal of the American Chemical Society, 2003
- An Efficient Branch-and-Bound Algorithm for Finding a Maximum Clique2003
- Arboricity and Subgraph Listing AlgorithmsSIAM Journal on Computing, 1985
- Generating All Maximal Independent Sets: NP-Hardness and Polynomial-Time AlgorithmsSIAM Journal on Computing, 1980
- A New Algorithm for Generating All the Maximal Independent SetsSIAM Journal on Computing, 1977
- Algorithm 457: finding all cliques of an undirected graphCommunications of the ACM, 1973
- On cliques in graphsIsrael Journal of Mathematics, 1965