Improved upper bounds in clique partitioning problem
In this work, a problem of partitioning a complete weighted graph into cliques in such a way that sum of edge weights between vertices belonging to the same clique is maximal is considered. This problem is known as a clique partitioning problem. It arises in many applications and is a varian of clas...
Main Authors: | , , , |
---|---|
Format: | Article |
Language: | Belarusian |
Published: |
Belarusian State University
2019-11-01
|
Series: | Журнал Белорусского государственного университета: Математика, информатика |
Subjects: | |
Online Access: | https://journals.bsu.by/index.php/mathematics/article/view/1050 |