3 papers
cs.DS2026
Parameterized Complexity of Biclique Contraction and Balanced Biclique Contraction
R. Krithika, V. K. Kutty Malu, Roohani Sharma +1
In this work, we initiate the complexity study of Biclique Contraction and Balanced Biclique Contraction. In these problems, given as input a graph G and an integer k, the objectiv…
cs.CC2025
The Complexity of Contracting Bipartite Graphs into Small Cycles
R. Krithika, Roohani Sharma, Prafullkumar Tale
For a positive integer , the -Contractibility problem takes as input an undirected simple graph and determines whether can be transformed into a graph…
cs.DS2025
A Single Exponential-Time FPT Algorithm for Cactus Contraction
R. Krithika, Pranabendu Misra, Prafullkumar Tale
For a collection of graphs, the -\textsc{Contraction} problem takes a graph and an integer as input and decides if can be modified to some gr…