Sentence examples for partition problem from inspiring English sources

A generalized spectral clustering technique is adopted to solve the hypergraph partition problem.

Then genetic algorithm is proposed to search near-optimal solution for this network partition problem.

Both proofs use a reduction of the partition problem, an NP-complete problem [21].

In this study, we investigate the community partition problem in social networks.

We address this issue as a partition problem of implementing network protocol functions into dynamically reconfigurable hardware and software modules.

So, we have successfully reduced the partition problem to the example of MDP problem in polynomial time.

We wish to solve the three-partition problem instance using the algorithm solving 3-CCBC.

This problem reduces to the graph-partition problem with the constraints of contiguity and compactness.

We consider the edge-partition problem, which is a graph theoretic problem arising in the design of Synchronous Optical Networks.

Due to the NP-completeness of the graph-partition problem, there are too many possibilities of districting plans.

If the answer is YES, then we find m subsets of W as B 4 < Γ i < B 2, which implies that we can find m subsets of A of the three-partition problem satisfying the respective constraints.