Finding maximum cliques in arbitrary and in special graphs

Computing

Volumn 46, Issue 4, 1991, Pages 321-341

  Babel, L ^a  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

AMS Subject Classification: O5C35, 68R10; branch and bound algorithm; Maximum clique problem; polynomial solvable problems

Indexed keywords

COMPUTER PROGRAMMING - ALGORITHMS; PROBABILITY - RANDOM PROCESSES;

BRANCH AND BOUND ALGORITHMS; MAXIMUM CLIQUES; RANDOM GRAPHS;

MATHEMATICAL TECHNIQUES;

EID: 0025904136     PISSN: 0010485X     EISSN: 14365057     Source Type: Journal    
DOI: 10.1007/BF02257777     Document Type: Article

References (36)

1. A branch and bound algorithm for the maximum clique problem
2. New methods to color the vertices of a graph
3. Incidence matrices and interval graphs
4. The NP-completeness column: an ongoing guide
5. The NP-completeness column: an ongoing guide
6. Steiner trees, partial 2-trees, and minimum IFI networks
7. Heuristics for graph colorings
8. An analysis of some graph theoretical cluster techniques
9. A node covering algorithm
10. Finding a maximum clique in an arbitrary graph
11. Finding all cliques of an undirected graph
12. Clique detection for nondirected graphs: Two new algorithms
13. A new backtracking algorithm for generating the family of maximal independent sets of a graph
14. Determining the number of internal stability of a graph
15. Vertex packings: structural properties and algorithms
16. Finding a maximum independent set
17. A linear recognition algorithm for cographs
18. Algorithms for minimum coloring, maximum clique, minimum covering by cliques, and maximum independent set of a chordal graph
19. Algorithms for a maximum clique and maximum independent set of a circle graph
20. Algorithms on circular-arc-graphs
21. Stability in circular-arc-graphs
22. Efficient algorithms for interval graphs and circular-graphs
23. A polynomial algorithm for maximum weighted vertex packings on graphs without long odd cycles
24. Algorithms for maximum weight cliques, minimum weighted clique covers and minimum colorings of claw-free perfect graphs
25. An optimal algorithm for finding a maximum independent set of a circular-arc-graph
26. Efficient algorithms for finding maximum cliques of an overlap graph
27. On maximal independent sets of vertices in claw-free graphs
28. The clique problem for planar graphs
29. Algorithmic aspects of vertex elimination on graphs
30. Finding maximum cliques in circle graphs