Sentence examples for the partitioning of a graph from inspiring English sources

Our result is stated in terms of the partitioning of a graph into edge-disjoint spanning trees.

All modularity optimization approaches make implicitly the following assumptions: The best partition of a graph is the one that maximize the modularity.

The best partition of a graph is the one that maximize the modularity.

This paper concerns the optimal partition of a graph into p connected clusters of vertices, with various constraints on their topology and weight.

In addition, the partitioning of graph based on regions is more robust and insensitive to noise than that based on pixels.

This paper presents a method for finding a partition of a graph that can be applied to many problems related to fault-tolerant computing.

In a short time the Q function evaluating the goodness of partitioning a graph into given clusters became an essential element of a wide range of clustering methods.

All three graph-related gene features are related to the partition of the HDN/DGN graph into one large connected component and a series of small connected components.

3 The minimum clique partition solution of a graph (mathcal {G}) is the minimum set of disjoint cliques of (mathcal {G}) that together cover all the vertices.

Spectral graph partitioning is a method of partitioning a graph into two subgraphs in such a way that the subgraphs have the approximately equal number of vertices while minimizing the number of edges between the two subgraphs.

This problem can be redefined as a partition problem that is to partition the vertex set of a graph into two parts I and F, where I induces an independent set (a 0-regular graph) and F induces a perfect matching (a 1-regular graph).