Skip to search formSkip to main contentSkip to account menu

3-partition problem

Known as: 3-partition, Three processor problem, Unary 3-partition 
The 3-partition problem is an NP-complete problem in computer science. The problem is to decide whether a given multiset of integers can be… 
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
Chordal graphs are intersection graphs of subtrees in a tree. We investigate complexity of the partial representation extension… 
Highly Cited
2009
Highly Cited
2009
In continuation of previous work, we analyze the properties of spectral minimal partitions and focus in this paper our analysis… 
2009
2009
The historical research line on the algebraic properties of structured CF languages initiated by McNaughton's Parenthesis… 
2005
2005
  • P. Dutot
  • Eur. J. Oper. Res.
  • 2005
  • Corpus ID: 2833167
Review
2005
Review
2005
An important line of inquiry in cluster validation involves measuring the stability of a partition with respect to perturbations… 
Highly Cited
2001
Highly Cited
2001
Thresholding is a commonly used technique in image segmentation. Selecting the correct thresholds is a critical issue. In this… 
Highly Cited
1985
Highly Cited
1985
For any positive integer s, an s-partition of a graph G = (V, E) is a partition of E into E1 ∪ E2 ∪… ∪ Ek, where ∣Ei∣ = s for 1…