Xu, Hong, T. K. Satish Kumar, and Sven Koenig. “A Linear-Time and Linear-Space Algorithm for the Minimum Vertex Cover Problem on Giant Graphs”. Proceedings of the International Symposium on Combinatorial Search 8, no. 1 (September 1, 2021): 173–174. Accessed May 27, 2026. https://ojs.aaai.org/index.php/SOCS/article/view/18414.