Abstract
This paper is about partitioning a set of objects with respect to non-numerical criteria. We represent the partitioning problem as a complete graph partitioning. Two partitioning semantics (global and local partitioning semantics), based on non-numerical criteria, are presented. Partitioning problem algorithms for finding all best partition values are detailed for both semantics.