Author

Sort by: Order: Results:

  • Parameterized complexity of fair feedback vertex set problem 
    Kanesh, Lawqueen; MAITY, SOUMEN; Muluk, Komal; Saurabh, Saket (Elsevier B.V., 2021-05)
    Given a graph , a subset is said to be a feedback vertex set of G if is a forest. In the Feedback Vertex Set (FVS) problem, we are given an undirected graph G, and a positive integer k, the question is whether there ...

Search Repository


Advanced Search

Browse

My Account