Maximum cut on line and total graphs
type: Item
instance of: scholarly article
title: Maximum cut on line and total graphs
zbMATH Open document ID: 0935.68082
DOI: 10.1016/S0166-218X(99)00056-6
author: Venkatesan Guruswami
published in: Discrete Applied Mathematics
publication date: 1999-11-23T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68P10
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C45
zbMATH DE Number: 1339920
zbMATH Keywords: maximum cut problem
MaRDI profile type: Publication
cites work: A polynomial characterization of some graph partitioning problems
cites work: The max-cut problem on graphs not contractible to \(K_ 5\)
cites work: Q4942616
cites work: Some simplified NP-complete graph problems
cites work: A polynomial algorithm for the max-cut problem on graphs without long odd cycles
cites work: Finding a Maximum Cut of a Planar Graph in Polynomial Time
cites work: Q4840774
full work available at URL: s0166-218x(99)00056-6
OpenAlex ID: W2170458234
Wikidata QID: Q127179048
description: scientific article; zbMATH DE number 1339920