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)

Semantic Scholar uses AI to extract papers important to this topic.

2006

2006

- Cristina Bazgan, Zsolt Tuza, Daniel Vanderpooten
- Discrete Applied Mathematics
- 2006

The Satisfactory Partition problem consists in deciding if a given graph has a partition of its vertex set into two nonemptyâ€¦Â (More)

Is this relevant?

Highly Cited

2005

Highly Cited

2005

- James Aspnes, Kevin L. Chang, Aleksandr Yampolskiy
- SODA
- 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

- Refael Hassin, JÃ©rÃ´me Monnot
- Oper. Res. Lett.
- 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

- Olivier Goldschmidt, Dorit S. Hochbaum, Asaf Levin, Eli V. Olinick
- Networks
- 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

- Raffaella Gentilini, Carla Piazza, Alberto Policriti
- TACAS
- 2002

The problem of determining the coarsest partition stable with respect to a given binary relation, is known to be equivalent toâ€¦Â (More)

Is this relevant?

Highly Cited

2001

Highly Cited

2001

- Tony F. Chan, Luminita A. Vese
- IEEE Trans. Image Processing
- 2001

We propose a new model for active contours to detect objects in a given image, based on techniques of curve evolution, Mumfordâ€¦Â (More)

Is this relevant?

Highly Cited

1999

Highly Cited

1999

- Anne Condon, Richard M. Karp
- RANDOM-APPROX
- 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

- Izak Broere, Michael Dorfling, Jean E. Dunbar, Marietjie Frick
- Discussiones Mathematicae Graph Theory
- 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

- Klaus Jansen
- CIAC
- 1997

In this paper, we study the optimum cost chromatic partition (OCCP) problem for several graph classes. The OCCP problem is theâ€¦Â (More)

Is this relevant?

1996

1996

- Dorit S. Hochbaum, Anu Pathria
- Networks
- 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?