Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
ESA
/
Paper
Simple and Fast: Improving a Branch-And-Bound Algorithm for Maximum Clique.
Torsten Fahle
Venue
A
ESA
Year
2002
Proceedings
ESA
DBLP record
conf/esa/Fahle02 ↗
Browse the full
ESA paper archive
.