A branch and bound algorithm for the maximum clique problem
- 1 July 1992
- journal article
- Published by Elsevier BV in Computers & Operations Research
- Vol. 19 (5), 363-375
- https://doi.org/10.1016/0305-0548(92)90067-f
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Graph separation techniques for quadratic zero-one programmingComputers & Mathematics with Applications, 1991
- Parallel branch and bound algorithms for quadratic zero–one programs on the hypercube architectureAnnals of Operations Research, 1990
- An exact algorithm for the maximum clique problemOperations Research Letters, 1990
- Computational aspects of a branch and bound algorithm for quadratic zero-one programmingComputing, 1990
- Finding a Maximum Clique in an Arbitrary GraphSIAM Journal on Computing, 1986
- Algorithms for maximum independent setsJournal of Algorithms, 1986
- Roof duality, complementation and persistency in quadratic 0–1 optimizationMathematical Programming, 1984
- Clique detection for nondirected graphs: Two new algorithmsComputing, 1979
- Finding a Maximum Independent SetSIAM Journal on Computing, 1977
- Branch-and-Bound Methods: A SurveyOperations Research, 1966