A heuristic for max-cut in toroidal grid graphs

Autor:	Claudio Gentile, Giovanni Rinaldi, Esteban Salgado, Bao Duy Tran
Jazyk:	angličtina
Rok vydání:	2020
Předmět:	max-cut toroidal grid graphs heuristics Ising spin glass subgraph sampling MathematicsofComputing_DISCRETEMATHEMATICS
Zdroj:	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
Popis:	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.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=cnr_________::cb87bcfe7f498e9387043a4d42873a2c http://www.cnr.it/prodotto/i/435156 Zobrazit plný text záznamu