scientific article; zbMATH DE number 5244012

zbMath1136.68618MaRDI QIDQ5446124

Manal Mohamed, Costas S. Iliopoulos, Lu Yang, W. F. Smyth, Richard John Cole

Publication date: 6 March 2008

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

vertex cover

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items

Enhanced string covering, String Covering: A Survey, Experimental evaluation of algorithms for computing quasiperiods, Efficient Computation of 2-Covers of a String., String covering with optimal covers, Computing regularities in strings: a survey, New complexity results for the \(k\)-covers problem, Quasi-Periodicity in Streams, A Linear-Time Algorithm for Seeds Computation