Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
SODA
/
Paper
A polynomial algorithm to find an independent set of maximum weight in a fork-free graph.
Vadim V. Lozin
,
Martin Milanic
Venue
A*
SODA
Year
2006
Proceedings
SODA
DBLP record
conf/soda/LozinM06 ↗
Browse the full
SODA paper archive
.