Abstract

H. Xu, S. Kumar and S. Koenig. A Linear-Time and Linear-Space Algorithm for the Minimum Vertex Cover Problem on Giant Graphs [Short Paper]. In Proceedings of the Symposium on Combinatorial Search (SoCS), pages 173-175, 2017.

Download the paper in pdf.

Many publishers do not want authors to make their papers available electronically after the papers have been published. Please use the electronic versions provided here only if hardcopies are not yet available. If you have comments on any of these papers, please send me an email! Also, please send me your papers if we have common interests.


This page was automatically created by a bibliography maintenance system that was developed as part of an undergraduate research project, advised by Sven Koenig.