Sentence examples for partitioning operation from inspiring English sources

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.

These adjustments helped Tim to construct partitioning operations and an appropriate unit fractional scheme.

This generally results in slow and inaccurate partitioning operations.

Accordingly, the total number of invoked graph partitioning operations is bounded by (O(mu (G))).

Therefore, the maximal cliques of G can be computed with two partitioning operations.

Since this algorithm uses both binary and multi-way partitioning operations, which are the key characteristics of the GP and BK algorithms, respectively, it is called Hybrid.