XU, Hong; KUMAR, T. K. Satish; KOENIG, Sven. A Linear-Time and Linear-Space Algorithm for the Minimum Vertex Cover Problem on Giant Graphs. Proceedings of the International Symposium on Combinatorial Search, [S. l.], v. 8, n. 1, p. 173–174, 2021. DOI: 10.1609/socs.v8i1.18414. Disponível em: https://ojs.aaai.org/index.php/SOCS/article/view/18414. Acesso em: 27 may. 2026.