A fixed-parameter algorithm for the Max-Cut problem on embedded 1-planar graphs
type: Item
instance of: scholarly article
title: A fixed-parameter algorithm for the Max-Cut problem on embedded 1-planar graphs
DOI: 10.1007/978-3-319-94667-2_12
author: Christine Dahn
author: Nils Kriege
author: Petra Mutzel
publication date: 2018-09-06T00:00:00Z
full work available at URL: https://arxiv.org/abs/1803.10983
Mathematics Subject Classification ID: 68Rxx
Mathematics Subject Classification ID: 68Wxx
zbMATH DE Number: 6932699
zbMATH Keywords: maximum cut
zbMATH Keywords: fixed-parameter tractable
zbMATH Keywords: 1-planar graphs
MaRDI profile type: Publication
OpenAlex ID: W2794618278
Recommended article: Fixed-parameter algorithms for the weighted max-cut problem on embedded 1-planar graphs
Recommended article: Q5875545
Recommended article: An improved fixed-parameter algorithm for max-cut parameterized by crossing number
Recommended article: Q5501344
Recommended article: Gap Inequalities for the Max-Cut Problem: A Cutting-Plane Algorithm
Recommended article: Fixed parameter algorithms for DOMINATING SET and related problems on planar graphs
Recommended article: An exact algorithm for MAX-CUT in sparse graphs
Recommended article: Q3476627
Recommended article: A novel formulation of the max-cut problem and related algorithm
Recommended article: Improved algorithms for min cut and max flow in undirected planar graphs
description: scientific article; zbMATH DE number 6932699