Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 205,657,148 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
Create Alert
Alert
Related topics
Related topics
8 relations
3-dimensional matching
Computer science
List of NP-complete problems
Michael Garey
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Review
2017
Review
2017
Computational method for unsupervised segmentation of lymphoma histological images based on fuzzy 3-partition entropy and genetic algorithm
T. A. A. Tosta
,
P. R. D. Faria
,
L. A. Neves
,
M. Z. Nascimento
Expert Syst. Appl.
2017
Corpus ID: 41843586
2012
2012
Extending Partial Representations of Subclasses of Chordal Graphs
Pavel Klavík
,
J. Kratochvíl
,
Y. Otachi
,
Toshiki Saitoh
ISAAC
2012
Corpus ID: 2381135
Chordal graphs are intersection graphs of subtrees in a tree. We investigate complexity of the partial representation extension…
Expand
Review
2010
Review
2010
Cross dock scheduling: Classification, literature review and research agenda
N. Boysen
,
Malte Fliedner
2010
Corpus ID: 34728
Highly Cited
2009
Highly Cited
2009
On spectral minimal partitions : the case of the sphere
B. Helffer
,
T. Hoffmann-Ostenhof
,
S. Terracini
2009
Corpus ID: 14363749
In continuation of previous work, we analyze the properties of spectral minimal partitions and focus in this paper our analysis…
Expand
2009
2009
Algebraic properties of structured context-free languages: old approaches and novel developments
S. Crespi-Reghizzi
,
D. Mandrioli
ArXiv
2009
Corpus ID: 18856488
The historical research line on the algebraic properties of structured CF languages initiated by McNaughton's Parenthesis…
Expand
2005
2005
Complexity of master-slave tasking on heterogeneous trees
P. Dutot
Eur. J. Oper. Res.
2005
Corpus ID: 2833167
Review
2005
Review
2005
Determining the number of groups from measures of cluster stability
G. B. Mufti
,
P. Bertrand
,
L. E. Moubarki
2005
Corpus ID: 14046018
An important line of inquiry in cluster validation involves measuring the stability of a partition with respect to perturbations…
Expand
Highly Cited
2001
Highly Cited
2001
A technique of three-level thresholding based on probability partition and fuzzy 3-partition
Mansuo Zhao
,
Alan M. N. Fu
,
Hong Yan
IEEE Trans. Fuzzy Syst.
2001
Corpus ID: 46551286
Thresholding is a commonly used technique in image segmentation. Selecting the correct thresholds is a critical issue. In this…
Expand
1994
1994
Persistency in maximum cardinality bipartite matchings
Marie-Christine Costa
Oper. Res. Lett.
1994
Corpus ID: 44618313
Highly Cited
1985
Highly Cited
1985
On partitioning the edges of graphs into connected subgraphs
M. Jünger
,
G. Reinelt
,
W. Pulleyblank
J. Graph Theory
1985
Corpus ID: 5211654
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…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
,
Terms of Service
, and
Dataset License
ACCEPT & CONTINUE