Sentence examples for partition operation from inspiring English sources

It is worthy to point out that the multi-way partition operation is essentially the core search operation used by the classical BK algorithm.

We observe that the performance of Algorithm 2 largely depends on the number of the generated (G texttt {cand}^+)) subgraphs, on which the partition operation is iteratively executed.

Updating (G texttt {cand})) with (G texttt {cand}^texttt )) (Lines 11 12), it then iteratively invokes the partition operation to search for the maximal cliques in (G texttt {cand}^texttt )) until (G texttt {cand}^texttt )) becomes a clique (Lines 4 12).

A value of zero indicates that the two reactions are immediately separated after the first partition operation, whereas a value close to one indicates that the two reactions remain together in the same module through many rounds of partition operations.

To reduce the number of invoked partition operations, the hybrid algorithm considers multi-way partitioning as well as binary partitioning.

Lines 5 19 specify the multi-way partitioning operation and Lines 22 28 specify the binary partitioning operation.

The partitioning operation can be iteratively invoked until all the resulting subgraphs become cliques.

For the Hybrid algorithm, vertex degrees in each subgraph resulting from a multi-way BK partitioning operation are computed by intersecting two adjacency sets.

Whenever a (G texttt {cand}^-)) subgraph becomes a clique, it pops a (G texttt {cand}^+)) subgraph from the stack and repeats the iterative partitioning operation.

Specifically, if the largest degree of the vertices in (G texttt {cand})), compared with the total number vertices in the graph, exceeds a predefined threshold (theta ) (e.g., (theta =0.8)), the hybrid algorithm would execute the multi-way partitioning operation; otherwise, it would execute the binary partitioning operation.

Besides the (G texttt {cand}^texttt )) graph, it also has to store the resulting (G texttt {cand}^texttt )) subgraphs in a stack S. Each (G texttt {cand}^texttt )) results from a partitioning operation with a vertex (v_i) as anchor.