Sciweavers

DAM
2006
81views more  DAM 2006»
13 years 11 months ago
The satisfactory partition problem
The Satisfactory Partition problem consists in deciding if a given graph has a partition of its vertex set into two nonempty parts such that each vertex has at least as many neigh...
Cristina Bazgan, Zsolt Tuza, Daniel Vanderpooten
EOR
2010
82views more  EOR 2010»
13 years 11 months ago
Satisfactory graph partition, variants, and generalizations
The Satisfactory Partition problem asks for deciding if a given graph has a partition of its vertex set into two nonempty parts such that each vertex has at least as many neighbor...
Cristina Bazgan, Zsolt Tuza, Daniel Vanderpooten
ISAAC
2003
Springer
75views Algorithms» more  ISAAC 2003»
14 years 4 months ago
On the Existence and Determination of Satisfactory Partitions in a Graph
The Satisfactory Partition problem consists in deciding if a given graph has a partition of its vertex set into two nonempty sets V1, V2 such that for each vertex v, if v ∈ Vi th...
Cristina Bazgan, Zsolt Tuza, Daniel Vanderpooten
COCOON
2005
Springer
14 years 5 months ago
Complexity and Approximation of Satisfactory Partition Problems
The Satisfactory Partition problem consists of deciding if a given graph has a partition of its vertex set into two nonempty parts such that each vertex has at least as many neighb...
Cristina Bazgan, Zsolt Tuza, Daniel Vanderpooten