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 graph / Gentile, Claudio; Rinaldi, Giovanni; Salgado, Esteban; Duy Tran, Bao. - (2020).

A heuristic for max-cut in toroidal grid graph

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 allegati a questo prodotto
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11573/1618995
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus ND
  • ???jsp.display-item.citation.isi??? ND
social impact