Skip to main content

and
  1. No Access

    Chapter and Conference Paper

    Sparsity in Covering Solutions

    In the classical covering problems, the goal is to find a subset of vertices/edges that “covers” a specific structure of the graph. In this work, we initiate the study of the covering problems where given a gr...

    Pallavi Jain, Manveer Singh Rathore in LATIN 2024: Theoretical Informatics (2024)