Weighted and unweighted maximum clique algorithms with upper bounds from fractional coloring

New methods to color the vertices of a graph

Daniel Brélaz · Communications of the ACM · 1979 · 1.6K citations · Full text

Natural Sciences, Computer Science, Mathematics +16

An upper bound for the chromatic number of a graph and its application to timetabling problems

Dominic Welsh · The Computer Journal · 1967 · 764 citations · Full text

Natural Sciences, Computer Science, Mathematics +12

A graph coloring algorithm for large scheduling problems

Frank Thomson Leighton · Journal of Research of the National Bureau of Standards · 1979 · 492 citations · Full text

Computing, Computer Engineering, Computer Science +13

Finding a Maximum Clique in an Arbitrary Graph

Egon Balas, Chang Sung Yu · SIAM Journal on Computing · 1986 · 293 citations

Computing, Computer Science, Mathematics +15

A branch and bound algorithm for the maximum clique problem

Luitpold Babel, G. Tinhofer · Mathematical Methods of Operations Research · 1990 · 58 citations

Natural Sciences, Computer Science, Mathematics +10