An exact algorithm for the maximum clique problem
- 1 November 1990
- journal article
- Published by Elsevier in Operations Research Letters
- Vol. 9 (6), 375-382
- https://doi.org/10.1016/0167-6377(90)90057-c
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Finding a Maximum Clique in an Arbitrary GraphSIAM Journal on Computing, 1986
- Determining the number of internal stability of a graphInternational Journal of Computer Mathematics, 1982
- Clique detection for nondirected graphs: Two new algorithmsComputing, 1979
- Finding a Maximum Independent SetSIAM Journal on Computing, 1977
- Algorithm 457: finding all cliques of an undirected graphCommunications of the ACM, 1973
- On the theory of graphsColloquium Mathematicum, 1954