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...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Diego Recalde, Ramiro Torres, Polo Vaca
Formato: article
Lenguaje:EN
Publicado: Elsevier 2020
Materias:
Acceso en línea:https://doaj.org/article/5d5107523e8947faa2d68e575fb9853f
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!