The paper reports on some preliminary results obtained by using polynomial time algorithms to solve max-cut on some special graphs within a heuristic scheme known as subgraph sampling. Computational results are reported on toroidal graphs of about 100 000 nodes with edge weights generated from both a Gaussian and a bivariate uniform distribution.
A heuristic for max-cut in toroidal grid graphs
Claudio Gentile;Giovanni Rinaldi;Esteban Salgado;
2020
Abstract
The paper reports on some preliminary results obtained by using polynomial time algorithms to solve max-cut on some special graphs within a heuristic scheme known as subgraph sampling. Computational results are reported on toroidal graphs of about 100 000 nodes with edge weights generated from both a Gaussian and a bivariate uniform distribution.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
CTW2020_paper_86_447690.pdf
accesso aperto
Tipologia:
Versione Editoriale (PDF)
Licenza:
Altro tipo di licenza
Dimensione
323.64 kB
Formato
Adobe PDF
|
323.64 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
