Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
SoCS
/
Paper
A Linear-Time and Linear-Space Algorithm for the Minimum Vertex Cover Problem on Giant Graphs.
Hong Xu
,
T. K. Satish Kumar
,
Sven Koenig
Venue
B
SoCS
Year
2017
Proceedings
SOCS
DBLP record
conf/socs/XuKK17 ↗
Browse the full
SoCS paper archive
.