4797 search results - page 11 / 960 » The complexity of partition tasks |
COCOON
2005
Springer
14 years 1 months ago
2005
Springer
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...
CISIS
2009
IEEE
14 years 2 months ago
2009
IEEE
ICDCS
1994
IEEE
13 years 11 months ago
1994
IEEE
DEXA
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. The problems of finding alternative clusterings and avoiding bias have gained popularity over the last years. In this paper we put the focus on the quality of these alter...