1 citations · 1 across the 3 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2022
Parameterized Complexity of Path Set Packing
N. R. Aravind, Roopam Saxena
In Path Set Packing, the input is an undirected graph , a collection $\calp$ of simple paths in , and a positive integer . The problem is to decide whether there exist …
cs.DS2021★ 1 cited
An FPT algorithm for Matching Cut and d-cut
N R Aravind, Roopam Saxena
Given a positive integer , the d-CUT is the problem of deciding if an undirected graph has a cut such that every vertex in (resp. ) has at most neig…