Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
KDD
/
Paper
Efficient Maximum Clique Computation over Large Sparse Graphs.
Lijun Chang
Venue
A*
KDD
Year
2019
Proceedings
KDD
DBLP record
conf/kdd/Chang19 ↗
Browse the full
KDD paper archive
.