Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
CIKM
/
Paper
Finding a Dense Subgraph with Sparse Cut.
Atsushi Miyauchi
,
Naonori Kakimura
Venue
A
CIKM
Year
2018
Proceedings
CIKM
DBLP record
conf/cikm/MiyauchiK18 ↗
Browse the full
CIKM paper archive
.