In the CUT PACKING problem, given an undirected connected graph G, it is required to find the maximum number of pairwise edge disjoint cuts in G. It is an open question if CUT PACKING is NP-hard on general graphs. In this paper we prove that the problem is polynomially solvable on Seymour graphs which include both all bipartite and all series-parallel graphs. We also consider the weighted version of the problem in which each edge of the graph G has a nonnegative weight and the weight of a cut D is equal to the maximum weight of edges in D. We show that the weighted version is NP-hard even on cubic planar graphs.
CITATION STYLE
Ageev, A. A. (1999). On finding the maximum number of disjoint cuts in seymour graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1643, pp. 490–497). Springer Verlag. https://doi.org/10.1007/3-540-48481-7_42
Mendeley helps you to discover research relevant for your work.