In mathematics, the graph partition problem is defined on data represented in the form of a graph (mathematics)|graph G = (V,E), with V vertices and E edges, such that it is possible to partition of a set|partition G into smaller components with specific properties. For instance, a k-way partition divides the vertex set into k smaller components. A good partition is defined as one in which the number of edges running between separated components is small. Uniform graph partition is a type of graph partitioning problem that consists of dividing a graph into components, such that the components are of about the same size and there are few connections between the components. Important applications of graph partitioning include scientific computing, partitioning various stages of a VLSI design circuit and task scheduling in multi-processor systems. Recently, the uniform graph partition problem has gained importance due to its application for clustering and detection of cliques in social, pathological and biological networks.
In mathematics, the graph partition problem is defined on data represented in the form of a graph (mathematics)|graph G = (V,E), with V vertices and E edges, such that it is possible to partition of a set|partition G into smaller components with specific properties. For instance, a k-way partition divides the vertex set into k smaller components. A good partition is defined as one in which the number of edges running between separated components is small. Uniform graph partition is a type of graph partitioning problem that consists of dividing a graph into components, such that the components are of about the same size and there are few connections between the components. Important applications of graph partitioning include scientific computing, partitioning various stages of a VLSI design circuit and task scheduling in multi-processor systems. Recently, the uniform graph partition problem has gained importance due to its application for clustering and detection of cliques in social,...