Skip to main content

and
  1. No Access

    Chapter and Conference Paper

    Conflict Free Version of Covering Problems on Graphs: Classical and Parameterized

    Let \(\mathrm{\Pi }\) be a family of graphs. In the classical

    Pallavi Jain, Lawqueen Kanesh in Computer Science – Theory and Applications (2018)

  2. No Access

    Chapter and Conference Paper

    Reducing Rank of the Adjacency Matrix by Graph Modification

    The main topic of this article is to study a class of graph modification problems. A typical graph modification problem takes as input a graph G, a positive integer k and the objective is to add/delete k vertices...

    S. M. Meesum, Pranabendu Misra, Saket Saurabh in Computing and Combinatorics (2015)