Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
AAAI
/
Paper
An Efficient Branch-and-Bound Algorithm Based on MaxSAT for the Maximum Clique Problem.
Chu Min Li
,
Zhe Quan
Venue
A*
AAAI
Year
2010
Proceedings
AAAI
DBLP record
conf/aaai/LiQ10 ↗
Browse the full
AAAI paper archive
.