Kernels for the Vertex Cover Problem on the Preferred Attachment Model

DOI10.1007/11764298_21zbMath1196.05094OpenAlexW1554268450MaRDI QIDQ5307546

Jordi Petit, Dimitrios M. Thilikos, Josep Diaz

Publication date: 14 September 2007

Published in: Experimental Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11764298_21

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

Vertex cover kernelization revisited. Upper and lower bounds for a refined parameter ⋮ A novel parameterised approximation algorithm for \textsc{minimum vertex cover}

This page was built for publication: Kernels for the Vertex Cover Problem on the Preferred Attachment Model