Finding a Maximum Clique in an Arbitrary Graph

This publication has 14 references indexed in Scilit:

• Polynomial Algorithms for Perfect Graphs
  Published by Elsevier ,1984
• Determining the number of internal stability of a graph
  International Journal of Computer Mathematics, 1982
• Clique detection for nondirected graphs: Two new algorithms
  Computing, 1979
• A node covering algorithm
  Naval Research Logistics Quarterly, 1977
• On certain polytopes associated with graphs
  Journal of Combinatorial Theory, Series B, 1975
• Algorithm 457: finding all cliques of an undirected graph
  Communications of the ACM, 1973
• Normal hypergraphs and the perfect graph conjecture
  Discrete Mathematics, 1972
• Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
  SIAM Journal on Computing, 1972
• Incidence matrices and interval graphs
  Pacific Journal of Mathematics, 1965
• On rigid circuit graphs
  Abhandlungen aus dem Mathematischen Seminar der Universitat Hamburg, 1961