The maximum weight ({K1,K2},k,l)-packing problem in a graph

In this paper, we consider the maximum weight ({K1,K2},k,l)-packing problem in a graph. This problem generalizes a number of well-known problems, for example: maximum induced matching, k-separated matching, connected matching, independent set, dissociating set, k-packing. We show that in the class of cographs, a maximum weight ({K1,K2},k,l)- packing can be computed in O(n + m) time. Let Γ be a class of graphs and Γ* be a class of all simple (with respect to the modular decomposition) induced subgraphs from Γ. It is proven that if the maximum weight ({K1,K2},k,l)-packing problem can be solved in the class of graphs Г* in time O(np ), where p ≥ 2 is a constant, then this problem can be solved in the class of graphs Г in time O(np ).