New NP-complete partition problemsProposes several problems in partitions. Definitions of the partition problems; Discussion on the proofs of completeness for the problems; Discussion on a problem in syndrome decoding.SaeedniaShahrokhEBSCO_AspIEEE Transactions on Information Theory...
Although it is polynomial to determine whether a graph is unipolar and to find whenever possible a unipolar partition, the problems of recognizing polar and monopolar graphs are both NP-complete in general. These problems have recently been studied for chordal, claw-free, and permutation graphs. ...
"Intuitively, this sounds like an NP-complete problem (it reduces to a problem very like bin packing), however the following algorithm (a modified form of bin packing) should be pretty good (no time for a proof, sorry). Net out everyone's positions, i.e. from your example above: Alice...
problem where the two partite sets are required to have the same cardinality. Both problems are known to be NP-complete. This problem was introduced by Gerber and Kobler [European J. Oper. Res. 125 (2000) 283-291] and further studied by other authors, but its parameterized complexity ...
Given a set of weights S={w i :1≤i≤n}, this paper considers the problem of constructing a partition of S into two sets which minimizes the difference of their total weights. This problem is known to be NP-complete. A polynomial algorithm is discussed which approximates an optimal parti...
关键词: Membrane computing P system Membrane division Uniform solution NP-complete problem DOI: 10.1007/978-3-662-45049-9_33 被引量: 1 年份: 2014 收藏 引用 批量引用 报错 分享 全部来源 求助全文 Springer Ingenta dx.doi.org ResearchGate zentralblatt-math.org 相似文献 参考文献 引证文献...
1.2 Existing Graph Partitioning Methods The graph partitioning problem has been studied extensively in many application areas (e.g., VLSI design). The problem of find- ing an optimal partition is NP-Complete [23]. As a result, many approximate solutions have been proposed [5, 6]. However, ...
1. Introduction 2. The paw-free graph sandwich problem 3. The claw-free graph sandwich problem 4. The bull-free graph sandwich problem 5. The skew partition sandwich problem 6. More NP-complete problems 7. Concluding remarks References Cited by (4) Figures (6) Tables (1) Table 1Discrete...
The present paper considers the external constraint, four nonempty parts, partition problem whose complexity is not known. 2K2-partition is polynomial-time solvable for C4-free graphs, circular-arc graphs, spiders, P4-sparse graphs, and bipartite graphs. list2K2-partition is NP-complete, so we ...
In addition a job-assignment problem given intervals for each job and k machines, each executing at most k ′ jobs, equals the first problem restricted to interval graphs. It is shown, that both problem are NP-complete. 展开 关键词: electronic publisher online databases online resources ...