The partition problem is intuitive: Given a collection of n objects, can we place part of those objects in the left hand of a balance and the remaining objects in the right hand side of a balance so ...

Partition problem is to determine whether a given set can be partitioned into two subsets such that the sum of elements in both subsets is the same. The partition problem is NP-complete. In our ...

Abstract: For any positive integer k, the total k-domatic partition problem is to partition the vertices of a graph G into k pairwise disjoint total dominating sets. In this paper, we study the ...

Balanced edge partition has emerged as a new approach to partition an input graph data for the purpose of scaling out parallel computations, which is of interest for several modern data analytics ...