AAAI Publications, Tenth Annual Symposium on Combinatorial Search

Font Size: 
A Linear-Time and Linear-Space Algorithm for the Minimum Vertex Cover Problem on Giant Graphs
Hong Xu, T. K. Satish Kumar, Sven Koenig

Last modified: 2017-06-05


In this paper, we develop the message passing based linear-time and linear-space MVC algorithm (MVC-MPL) for solving the minimum vertex cover (MVC) problem. MVC-MPL is based on heuristics derived from a theoretical analysis of message passing algorithms in the context of belief propagation. We show that MVC-MPL produces smaller vertex covers than other linear-time and linear-space algorithms.

Full Text: PDF