A warning propagation-based linear-time-and-space algorithm for the minimum vertex cover problem on giant graphs
From MaRDI portal
Publication:1626790
DOI10.1007/978-3-319-93031-2_41OpenAlexW2786869873MaRDI QIDQ1626790
Sven Koenig, T. K. Satish Kumar, Hong Xu, Kexuan Sun
Publication date: 21 November 2018
Full work available at URL: https://doi.org/10.1007/978-3-319-93031-2_41
Analysis of algorithms (68W40) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Graph algorithms (graph-theoretic aspects) (05C85)
This page was built for publication: A warning propagation-based linear-time-and-space algorithm for the minimum vertex cover problem on giant graphs
