28 citations · 30 across the 2 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2020
Fixed-Parameter Tractability of the Weighted Edge Clique Partition Problem
Andreas Emil Feldmann, Davis Issac, Ashutosh Rai
We develop an FPT algorithm and a bi-kernel for the Weighted Edge Clique Partition (WECP) problem, where a graph with vertices and integer edge weights is given together with a…
cs.DS2018
A Polynomial Kernel for Diamond-Free Editing
Yixin Cao, Ashutosh Rai, R. B. Sandeep +1
An -free editing problem asks whether we can edit at most edges to make a graph contain no induced copy of the fixed graph . We obtain a polynomial kernel for this proble…