Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
STOC
/
Paper
Approximation algorithm for k-node connected subgraphs via critical graphs.
Guy Kortsarz
,
Zeev Nutov
Venue
A*
STOC
Year
2004
Proceedings
STOC
DBLP record
conf/stoc/KortsarzN04 ↗
Browse the full
STOC paper archive
.