Subject

Sort by: Order: Results:

  • Reducing the vertex cover number via edge contractions 
    Lima, Paloma T.; Santos, Vinicius F. dos; Sau, Ignasi; Souza, Uéverton S.; TALE, PRAFULLKUMAR (Elsevier B.V., 2023-09)
    Given a graph G on n vertices and two integers k and d, the Contraction(vc) problem asks whether one can contract at most k edges to reduce the vertex cover number of G by at least d. Recently, Lima et al. [JCSS 2021] ...