A fixed-parameter algorithm for the Max-Cut problem on embedded 1-planar graphs

DOI10.1007/978-3-319-94667-2_12OpenAlexW2794618278MaRDI QIDQ1670994

Christine Dahn, Petra Mutzel, Nils M. Kriege

Publication date: 6 September 2018

Full work available at URL: https://arxiv.org/abs/1803.10983

zbMATH Keywords

maximum cutfixed-parameter tractable1-planar graphs

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Discrete mathematics in relation to computer science (68Rxx)

Related Items (3)

Quantum Annealing versus Digital Computing ⋮ Maximum Cut Parameterized by Crossing Number ⋮ Fixed-parameter algorithms for the weighted max-cut problem on embedded 1-planar graphs

This page was built for publication: A fixed-parameter algorithm for the Max-Cut problem on embedded 1-planar graphs