Subject

Sort by: Order: Results:

  • A single exponential-time FPT algorithm for cactus contraction 
    Krithika, R.; Misra , Pranabendu; TALE, PRAFULLKUMAR (Elsevier B.V., 2023-04)
    For a collection F of graphs, the F-CONTRACTION problem takes a graph G and an integer k as input and decides if G can be modified to some graph in F using at most k edge contractions. The F-CONTRACTION problem is NP-Complete ...

Search Repository


Advanced Search

Browse

My Account