Finding A Small Vertex Cover in Massive Sparse Graphs: Construct, Local Search, and Preprocess

DOI10.1613/jair.5443zbMath1418.68164OpenAlexW2739688939MaRDI QIDQ5370992

Chuan Luo, Shaowei Cai, Jin Kun Lin

Publication date: 24 October 2017

Published in: Journal of Artificial Intelligence Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1613/jair.5443

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (4)

Improved local search for the minimum weight dominating set problem in massive graphs by using a deep optimization mechanism ⋮ On solving simplified diversified top-\(k\,s\)-plex problem ⋮ An improved configuration checking-based algorithm for the unicost set covering problem ⋮ SCCWalk: an efficient local search algorithm and its improvements for maximum weight clique problem

This page was built for publication: Finding A Small Vertex Cover in Massive Sparse Graphs: Construct, Local Search, and Preprocess