On the Power of Nodes of Degree Four in the Local Max-Cut Problem
From MaRDI portal
Publication:3563008
DOI10.1007/978-3-642-13073-1_24zbMath1284.05304MaRDI QIDQ3563008
Tobias Tscheuschner, Burkhard Monien
Publication date: 28 May 2010
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-13073-1_24
Related Items
Computing Stable Outcomes in Symmetric Additively Separable Hedonic Games, Representing Fitness Landscapes by Valued Constraints to Understand the Complexity of Local Search, Local approximation of the maximum cut in regular graphs, Settling the Complexity of Local Max-Cut (Almost) Completely, Computing Stable Outcomes in Hedonic Games