Partition problem

Known as: Number partitioning, Partitioning problem 
In number theory and computer science, the partition problem (or number partitioning) is the task of deciding whether a given multiset S of positive… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1972-2017
0204019722017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2006
2006
The Satisfactory Partition problem consists in deciding if a given graph has a partition of its vertex set into two nonempty… (More)
  • figure 1
Is this relevant?
Highly Cited
2005
Highly Cited
2005
We propose a simple game for modeling containment of the spread of viruses in a graph of <i>n</i> nodes. Each node must choose to… (More)
Is this relevant?
2005
2005
The input to the maximum saving partition problem consists of a set V = {1, . . . , n}, weights wi, i ∈ V , a sub-additive set… (More)
Is this relevant?
2003
2003
The edge-partitioning problem presented in this paper is motivated by a problem in the design of SONET telecommunication networks… (More)
Is this relevant?
2002
2002
The problem of determining the coarsest partition stable with respect to a given binary relation, is known to be equivalent to… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2001
Highly Cited
2001
We propose a new model for active contours to detect objects in a given image, based on techniques of curve evolution, Mumford… (More)
  • figure 2
  • figure 1
  • figure 4
  • figure 3
  • figure 7
Is this relevant?
Highly Cited
1999
Highly Cited
1999
The NP-hard graph bisection problem is to partition the nodes of an undirected graph into two equal-sized groups so as to… (More)
Is this relevant?
1998
1998
Let τ(G) denote the number of vertices in a longest path of the graph G and let k1 and k2 be positive integers such that τ(G… (More)
Is this relevant?
1997
1997
In this paper, we study the optimum cost chromatic partition (OCCP) problem for several graph classes. The OCCP problem is the… (More)
  • figure 1
  • figure 2
Is this relevant?
1996
1996
The bottleneck graph partition problem is to partition the nodes of a graph into two equally sized sets, so that the maximum edge… (More)
Is this relevant?