An exact algorithm for the maximum clique problem

Operations Research Letters

Volumn 9, Issue 6, 1990, Pages 375-382

  Carraghan, Randy ^a   Pardalos, Panos M ^b  

^a Computer Science Department Whitmore Laboratory ^*  (United States)

^b PENNSYLVANIA STATE UNIVERSITY   (United States)

Author keywords

enumerative algorithm; Fortran program; maximum clique; test problems

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES--FORTRAN; MATHEMATICAL PROGRAMMING; MATHEMATICAL TECHNIQUES--GRAPH THEORY;

ENUMERATIVE ALGORITHMS; MAXIMUM CLIQUE PROBLEMS; TEST PROBLEMS;

COMPUTER PROGRAMMING;

EID: 0025521978     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/0167-6377(90)90057-C     Document Type: Article

References (9)

1. Finding the maximum clique in an arbitrary graph
2. On the Complexity of Approximating the Independent Set Problem
3. Algorithm 457: finding all cliques of an undirected graph
4. An Efficient Implicit Enumeration Algorithm for the Maximum Clique Problem
5. Clique detection for nondirected graphs: Two new algorithms
6. Determining the number of internal stability of a graph
7. A branch and bound algorithm for the maximum clique problem
8. Finding a Maximum Independent Set
9. On the theory of graphs