An improved fixed-parameter algorithm for max-cut parameterized by crossing number
From MaRDI portal
Publication:2301753
DOI10.1007/978-3-030-25005-8_27OpenAlexW2956890893MaRDI QIDQ2301753
Yasuaki Kobayashi, Yusuke Kobayashi, Suguru Tamaki, Shuichi Miyazaki
Publication date: 25 February 2020
Full work available at URL: https://arxiv.org/abs/1904.05011
Related Items
Complexity and Polynomially Solvable Special Cases of QUBO, Parameterized analysis and crossing minimization problems, Complexity of maximum cut on interval graphs, Maximum Cut Parameterized by Crossing Number, Fixed-parameter algorithms for the weighted max-cut problem on embedded 1-planar graphs