Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
STACS
/
Paper
Linear Time 1/2-Approximation Algorithm for Maximum Weighted Matching in General Graphs.
Robert Preis
Venue
A
STACS
Year
1999
Proceedings
STACS
DBLP record
conf/stacs/Preis99 ↗
Browse the full
STACS paper archive
.