The complexity of SIMPLE MAX-CUT on comparability graphs
From MaRDI portal
(Redirected from The complexity of SIMPLE MAX-CUT on comparability graphs)
WARNING: Page is not linked to a MaRDI-Entity. Please add Sitelink / Wikibase-link.
WARNING: Page is not linked to a MaRDI-Entity. Please add Sitelink / Wikibase-link.