The complexity of SIMPLE MAX-CUT on comparability graphs
type: Item
instance of: scholarly article
title: The complexity of SIMPLE MAX-CUT on comparability graphs
zbMATH Open document ID: 1356.05093
author: Rafael Veiga Pocai
publication date: 2017-02-14T00:00:00Z
Mathematics Subject Classification ID: 05C60
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 6684464
zbMATH Keywords: max-cut
zbMATH Keywords: comparability graphs
zbMATH Keywords: computational complexity
MaRDI profile type: Publication
full work available at URL: j.endm.2016.10.040
OpenAlex ID: W2552930788
cites work: Fixed Linear Crossing Minimization by Reduction to the Maximum Cut Problem
cites work: Q4198056
cites work: Crossing minimization in linear embeddings of graphs
DOI: 10.1016/J.ENDM.2016.10.040
description: scientific article; zbMATH DE number 6684464