Finding cliques in an undirected graph

Keywords

Undirected graph, Graph, Computer science, Combinatorics, Mathematics

References

• Finding all cliques of an undirected graphC. Bron, J. Kerbosch — 1973

Cited by

• Optimization with Potts neural networks in high level synthesisWjm Wim Philipsen — 1995
• The Minimal k-Core Problem for Modeling k-AssembliesCynthia Ivette Wood, Illya V. Hicks — 2015
• Fault-tolerance in VLSI systems design using data compression under constraints of failure probabilities-overview and current statusSunil R. Das, Satyendra N. Biswas, Emil M. Petriu — 2013
• Aliasing-free compaction revisitedSunil R. Das, Altaf Hossain, Satyendra N. Biswas — 2008
• Algorithm 456: routing problemZdeněk Fencl — 1973
• Remark on Algorithm 420: Hidden-Line Plotting Program [J6]Hugh M. Williamson — 1973
• Remark on Algorithm 408: A Sparse Matrix Package (Part I) [F4]E. E. Lawrence — 1973
• Cliques of a graph-variations on the Bron-Kerbosch algorithmH. C. Johnston — 1976
• Algorithm 457: finding all cliques of an undirected graphCoen Bron, Joep Kerbosch — 1973
• Fault tolerant systems design in VLSI using data compression under constraints of failure probabilities: overview and statusSunil R. Das — 2007
• Clique Generalizations and Related ProblemsCynthia Ivette Wood — 2016
• Identifying Emerging Phenomenon in Plant Long Temporal Phenotyping ExperimentsJiajie Peng, Junya Lu, Donghee Hoh — 2018
• Identifying emerging phenomenon in long temporal phenotyping experimentsJiajie Peng, Junya Lu, Donghee Hoh — 2019
• Space compactor design in VLSI circuits based on graph theoretic conceptsSaroj Biswas, S.R. Das, Emil M. Petriu — 2005
• On a New Graph Theory Approach to Designing Zero-Aliasing Space Compressors for Built-In Self-TestingS.R. Das, Altaf Hossain, Saroj Biswas — 2006
• Space Compactor Design in VLSI Circuits Based on Graph Theoretic ConceptsSaroj Biswas, Emil M. Petriu, Sayan Das — 2006
• On a New Graph Theory Approach to Designing Zero-Aliasing Space Compressors for Built-In Self-TestingSunil R. Das, Altaf Hossain, Emil M. Petriu — 2006

Related papers

• An Approach to Determination of Maximal Cliques in Undirected GraphsS.V. LISTROVOY, А. В. Сидоренко, E.S. LISTROVAYA — 2018
• Algorithm 457: finding all cliques of an undirected graphCoen Bron, Joep Kerbosch — 1973
• On the order and the number of cliques in a random graphDaniel Olejár, Eduard Toman — 1997
• On cliques in graphsJ. W. Moon, Leo Moser — 1965