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 / Bruglieri, M.; Cordone, R.; Lari, I.; Ricca, F.; Scozzari, A.. - (2018), pp. 107-110. (Intervento presentato al convegno 16th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2018; Conservatoire National d'Arts et Metiers (CNAM)Paris; France; 18 June 2018 through 20 June 2018; Code 153590 tenutosi a Parigi, Francia).
Some polynomial special cases for the minimum gap graph partitioning problem
Lari I.;Ricca F.;
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 weightFile allegati a questo prodotto
| File | Dimensione | Formato | |
|---|---|---|---|
|
Ricca_Some-polynomial_2018.pdf
accesso aperto
Tipologia:
Versione editoriale (versione pubblicata con il layout dell'editore)
Licenza:
Tutti i diritti riservati (All rights reserved)
Dimensione
1.67 MB
Formato
Adobe PDF
|
1.67 MB | Adobe PDF |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
