A branch and bound algorithm for the maximum clique problem

Computers and Operations Research

Volumn 19, Issue 5, 1992, Pages 363-375

  Pardalos, Panos M ^a   Rodgers, Gregory P ^b  

^a UNIVERSITY OF FLORIDA   (United States)

^b IBM   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; MATHEMATICAL PROGRAMMING;

BRANCH AND BOUND ALGORITHM; MAXIMUM CLIQUE PROBLEM; UNCONSTRAINED QUADRATIC ZERO-ONE PROGRAMMING; VERTEX SELECTION;

GRAPH THEORY;

EID: 0026897860     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/0305-0548(92)90067-F     Document Type: Article

References (20)

1. Finding all cliques of an undirected graph
2. An Efficient Implicit Enumeration Algorithm for the Maximum Clique Problem
3. Branch and bound method general formulation and properties
4. Algorithms for maximum independent sets
5. Finding a maximum independent set
6. Finding the maximum clique in an arbitrary graph
7. Clique detection for nondirected graphs: two new algorithms
8. Branch and bound method a survey
9. Enumerative approaches to combinatorial optimization
10. Parallel branch and bound algorithms for quadratic zero-one programs on a hypercube architecture
11. Parallel branch and bound algorithms for unconstrained quadratic zero-one programming
12. Computational aspects of a branch and bound algorithm for quadratic zero-one programming
13. Roof-duality, complementation and persistency in quadratic 0–1 optimization
14. Quadratic functions of binary variables
15. Graph separation techniques for quadratic zero-one programming
16. Constrained Global Optimization: Algorithms and Applications
17. An exact algorithm for the maximum clique problem