A heuristic for max-cut in toroidal grid graphs

Autor: Claudio Gentile, Giovanni Rinaldi, Esteban Salgado, Bao Duy Tran

Publikováno v: CTW2020-18thj Cologne-Twente Workshop on Graphs and Combinatorial Optimization, Online, 14-16/09/2020
info:cnr-pdr/source/autori:Claudio Gentile, Giovanni Rinaldi, Esteban Salgado, Bao Duy Tran/congresso_nome:CTW2020-18thj Cologne-Twente Workshop on Graphs and Combinatorial Optimization/congresso_luogo:Online/congresso_data:14-16%2F09%2F2020/anno:2020/pagina_da:/pagina_a:/intervallo_pagine

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 10

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=cnr_________::cb87bcfe7f498e9387043a4d42873a2c
http://www.cnr.it/prodotto/i/435156