research
∙
09/19/2022
Parameterized Complexity of Path Set Packing
In PATH SET PACKING, the input is an undirected graph G, a collection P ...
share
research
∙
07/19/2021
Perfectly Matched Sets in Graphs: Hardness, Kernelization Lower Bound, and FPT and Exact Algorithms
In an undirected graph G=(V,E), we say (A,B) is a pair of perfectly matc...
research
∙
01/18/2021
