A novel approach to find partitions of $ Z_{m} $ with equal sum subsets via complete graphs
In mathematics and computer sciences, the partitioning of a set into two or more disjoint subsets of equal sums is a well-known NP-complete problem, also referred to as partition problem. There are various approaches to overcome this problem for some particular choice of integers. Here, we use quadr...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
AIMS Press
2021-07-01
|
| Series: | AIMS Mathematics |
| Subjects: | |
| Online Access: | https://aimspress.com/article/doi/10.3934/math.2021581?viewType=HTML |