Graph partition

（重定向自Graph partitioning）

Figure 1: The graph G = (5,4) is analysed for spectral bisection. The linear combination of the smallest two eigenvectors leads to [1 1 1 1 1]' having an eigen value = 0.

Figure 2: The graph G = (5,5) illustrates that the Fiedler vector in red bisects the graph into two communities, one with vertices 1,2,3 with positive entries in the vector space, and the other community has vertices 4,5 with negative vector space entries.

Figure 3: Weighted graph G may be partitioned to maximize Q in (a) or to minimize the ratio-cut in (b). We see that (a) is a better balanced partition, thus motivating the importance of modularity in graph partitioning problems.

In mathematics, the graph partition problem is defined on data represented in the form of a graph G = (V,E), with V vertices and E edges, such that it is possible to 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 graph partition problem has gained importance due to its application for clustering and detection of cliques in social, pathological and biological networks. For a survey on recent trends in computational methods and applications see Buluc et al. (2013).

单词	Graph partitioning
释义	Graph partitioning 英语百科 Graph partition （重定向自Graph partitioning） In mathematics, the graph partition problem is defined on data represented in the form of a graph G = (V,E), with V vertices and E edges, such that it is possible to 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 graph partition problem has gained importance due to its application for clustering and detection of cliques in social, pathological and biological networks. For a survey on recent trends in computational methods and applications see Buluc et al. (2013).
随便看	blast furnace bottom的意思 blast furnace brick的意思 blast furnace brickwork的意思 blast furnace bucket hoist的意思 blast furnace burden的意思 blast furnace bustle pipe的意思 blast furnace campaign的意思 blast furnace car的意思 blast furnace casting的意思 blast furnace cast iron的意思 blast furnace cement的意思 blast furnace charge的意思 blast furnace cinder的意思 blastfurnace cinder的意思 blast furnace coal tar的意思 blastfurnace coal tar的意思 blastfurnace coke的意思 blast furnace coke的意思 blast furnace control panel的意思 blast furnace crucibe的意思 blast furnace crucible的意思 blastfurnace dust的意思 blast furnace dust的意思 blast furnace dust collector的意思 blastfurnace elevator的意思