AI Chat AI Image Generator AI Video Text to Speech

MaxCut on Permutation Graphs is NP-complete

02/28/2022

∙

by Celina M. H. de Figueiredo, et al.

∙

∙

In this paper, we prove that the MaxCut problem is NP-complete on permutation graphs, settling a long-standing open problem that appeared in the 1985 column of the "Ongoing Guide to NP-completeness" by David S. Johnson.

Celina M. H. de Figueiredo
4 publications
Alexsander A. de Melo
3 publications
Fabiano S. Oliveira
7 publications
Ana Silva
18 publications

page 1

page 2

page 3

page 4

research

∙ 01/24/2023

Treewidth is NP-Complete on Cubic Graphs (and related results)

In this paper, we give a very simple proof that Treewidth is NP-complete...

0 Hans L. Bodlaender, et al. ∙

research

∙ 04/29/2021

Revising Johnson's table for the 21st century

What does it mean today to study a problem from a computational point of...

0 Celina M. H. de Figueiredo, et al. ∙

research

∙ 03/03/2018

Path Puzzles: Discrete Tomography with a Path Constraint is Hard

We prove that path puzzles with complete row and column information--or ...

0 Jeffrey Bosboom, et al. ∙

research

∙ 07/28/2017

A syntactic tool for proving hardness in the Second Level of the Polynomial-Time Hierarchy

In the nineties Immerman and Medina initiated the search for syn- tactic...

0 Edwin Pin, et al. ∙

research

∙ 04/08/2023

The n-vehicle exploration problem is NP-complete

The n-vehicle exploration problem (NVEP) is a combinatorial optimization...

0 Jinchuan Cui, et al. ∙

research

∙ 08/25/2021

Faster Exponential Algorithm for Permutation Pattern Matching

The Permutation Pattern Matching problem asks, given two permutations σ ...

0 Paweł Gawrychowski, et al. ∙

research

∙ 01/09/2019

On NP-completeness of the cell formation problem

In the current paper we provide a proof of NP-completeness for the CFP p...

0 Mikhail V. Batsyn, et al. ∙