Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
SODA
/
Paper
Approximating the minimum strongly connected subgraph via a matching lower bound.
Adrian Vetta
Venue
A*
SODA
Year
2001
Proceedings
SODA
DBLP record
conf/soda/Vetta01 ↗
Browse the full
SODA paper archive
.