How to Cut a Graph into Many Pieces
نویسندگان
چکیده
In this paper we consider the problem of finding a graph separator of a given size that decomposes the graph into the maximum number of connected components. We present the picture of the computational complexity and the approximability of this problem for several natural classes of graphs. We first provide an overview of the hardness of approximation of this problem, which stems mainly from its close relation to the INDEPENDENT SET and to the MAXIMUM CLIQUE problem. Next, we show that the problem is solvable in polynomial time for interval graphs and graphs of bounded treewidth. We also show that MAXINUM COMPONENTS is fixed-parameter tractable on planar graphs with the size of the separator as the parameter. Our main contribution is the derivation of an efficient polynomial-time approximation scheme for the problem on planar graphs.
منابع مشابه
Iterated Local Search Algorithm for the Constrained Two-Dimensional Non-Guillotine Cutting Problem
An Iterated Local Search method for the constrained two-dimensional non-guillotine cutting problem is presented. This problem consists in cutting pieces from a large stock rectangle to maximize the total value of pieces cut. In this problem, we take into account restrictions on the number of pieces of each size required to be cut. It can be classified as 2D-SLOPP (two dimensional single large o...
متن کاملCultural and Social Enigmas: Missing Pieces of Food Security
The growing attention in food security has suggested many approaches to develop a society free from hunger and malnutrition. Methodological approaches are mostly used to overcome the challenges of food security, but food insecurity is more than mere availability and access to food. Cultural and social dimensions and their intricacies to achieve food security are mostly missing from the lite...
متن کاملJudicious partitions and related problems
Many classical partitioning problems in combinatorics ask for a single quantity to be maximized or minimized over a set of partitions of a combinatorial object. For instance, Max Cut asks for the largest bipartite subgraph of a graphG, while Min Bisection asks for the minimum size of a cut into two equal pieces. In judicious partitioning problems, we seek to maximize or minimize a number of qua...
متن کاملSome Edge Cut Sets and an Upper bound for Edge Tenacity of Organic Compounds CnH2n+2
The graphs play an important role in our daily life. For example, the urban transport network can be represented by a graph, as the intersections are the vertices and the streets are the edges of the graph. Suppose that some edges of the graph are removed, the question arises, how damaged the graph is. There are some criteria for measuring the vulnerability of graph; the...
متن کاملIn vitro and in vivo Production of Gingerols and Zingiberene in Ginger Plant (Zingiber officinale Roscoe)
Ginger plant, Zingiber officinale Roscoe, is an important tropical plant used as spices and well known for its medicinal properties. It has a pungent and aromatic rhizome rich of zingiberen and gingerols. Many secondary metabolites are known to accumulate in the plant cell culture systems. So, in this research, gingerols and zingiberene production of callus cultures were compared...
متن کاملFinding Almost-Perfect Graph Bisections
We give a polynomial time algorithm that given a graph which admits a bisection cutting a fraction (1 − ε) of edges, finds a bisection cutting a (1 − g(ε)) fraction of edges where g(ε) → 0 as ε→ 0. One can take g(ε) = O( 3 √ ε log(1/ε)). Previously known algorithms for Max Bisection could only guarantee finding a bisection that cuts a fraction of edges bounded away from 1 (in fact less than 3/4...
متن کامل