We study various polynomial special cases for the problem of partitioning a vertex-weighted undirected graph into p connected subgraphs with minimum gap between the largest and the smallest vertex weight.
Some polynomial special cases for the Minimum Gap Graph Partitioning Problem / M. Bruglieri, R. Cordone, I. Lari, F. Ricca, A. Scozzari. ((Intervento presentato al 16. convegno Cologne-Twente Workshop on Graphs and Combinatorial Optimization tenutosi a Paris nel 2018.
Some polynomial special cases for the Minimum Gap Graph Partitioning Problem
R. Cordone;
2018
Abstract
We study various polynomial special cases for the problem of partitioning a vertex-weighted undirected graph into p connected subgraphs with minimum gap between the largest and the smallest vertex weight.
File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
MGGPP_CTW2018.pdf
accesso aperto
Descrizione: Articolo
Tipologia:
Post-print, accepted manuscript ecc. (versione accettata dall'editore)
Dimensione
290.79 kB
Formato
Adobe PDF
|
290.79 kB | Adobe PDF | Visualizza/Apri |
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
