An exact approach for the multi-constraint graph partitioning problem
In this work, a multi-constraint graph partitioning problem is introduced. The input is an undirected graph with costs on the edges and multiple weights on the nodes. The problem calls for a partition of the node set into a fixed number of clusters, such that each cluster satisfies a collection of n...
Enregistré dans:
| Auteurs principaux: | , , |
|---|---|
| Format: | article |
| Langue: | EN |
| Publié: |
Elsevier
2020
|
| Sujets: | |
| Accès en ligne: | https://doaj.org/article/5d5107523e8947faa2d68e575fb9853f |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|