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...
| Hoofdauteurs: | , , , |
|---|---|
| Formaat: | Artikel |
| Taal: | Belarusian |
| Gepubliceerd in: |
Belarusian State University
2019-11-01
|
| Reeks: | Журнал Белорусского государственного университета: Математика, информатика |
| Onderwerpen: | |
| Online toegang: | https://journals.bsu.by/index.php/mathematics/article/view/1050 |