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.;
2019-01-01
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 | |
|---|---|---|---|
|
CTW18_polynomial_cases_MGGPP.pdf
Accesso riservato
:
Post-Print (DRAFT o Author’s Accepted Manuscript-AAM)
Dimensione
290.79 kB
Formato
Adobe PDF
|
290.79 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
