Paper Info
Title
A branch and bound algorithm for the maximum clique problem
Abstract
We present a branch and bound algorithm for the maximum clique problem in arbitrary graphs. The main part of the algorithm consists in the determination of upper bounds by graph colorings. Using a modification of a known graph coloring method called DSATUR we simultaneously derive lower and upper bounds for the clique number.
Year
DOI
Venue
1990
10.1007/BF01415983
Mathematical Methods of Operations Research
Keywords
DocType
Volume
maximum clique problem,dsatur algorithm.,branch and bound algorithm,graph coloring
Journal
34
Issue
Citations 
PageRank 
3
19
2.44
References 
Authors
12
2
Name
Order
Citations
PageRank
Luitpold Babel118222.84
Gottfried Tinhofer211220.81