Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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

Related topics

Related topics

8 relations
3-dimensional matchingComputer scienceList of NP-complete problemsMichael Garey
Expand

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Single-commodity robust network design with finite and Hose demand sets
We study a single-commodity robust network design problem (sRND) defined on an undirected graph. Our goal is to determine minimum… Expand
  • figure 1
  • table 1
  • table 2
  • table 3
  • table 4
2014
2014
The Mondshein Sequence
Canonical orderings [STOC’88, FOCS’92] have been used as a key tool in graph drawing, graph encoding and visibility… Expand
  • figure 1
  • figure 2
2012
2012
Extending Partial Representations of Subclasses of Chordal Graphs
Chordal graphs are intersection graphs of subtrees in a tree. We investigate complexity of the partial representation extension… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 6
Highly Cited
2009
Highly Cited
2009
On spectral minimal partitions : the case of the sphere
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
The historical research line on the algebraic properties of structured CF languages initiated by McNaughton's Parenthesis… Expand
  • figure 1
  • figure 2
  • table 1
  • table 2
  • table 3
2007
2007
The size of minimum 3-trees
A 3-uniform hypergraph (3-graph) is said to be tight, if for any 3-partition of its vertex set there is a transversal triple. We… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
2006
2006
Job Sequencing with Exponential Functions of Processing Times
We study single machine scheduling problems, where processing times of the jobs are exponential functions of their start times… Expand
  • table 1
  • table 5
  • table 7
Highly Cited
2001
Highly Cited
2001
A technique of three-level thresholding based on probability partition and fuzzy 3-partition
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
  • M. Costa
  • Oper. Res. Lett.
  • 1994
    • Corpus ID: 44618313
Let G = (U, V, E) be an undirected bipartite graph. We specify some procedures that allow us to make efficiently the following 3… Expand
Highly Cited
1985
Highly Cited
1985
On partitioning the edges of graphs into connected subgraphs
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
  • figure 1
  • figure 2
  • figure 4
  • figure 5
  • figure 7
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