ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph and let (α,β)(\alpha,\beta) be a pair of integers with

max⁡{α,β}>1.\max\{\alpha,\beta\}>1.

An (α,β)(\alpha,\beta)-modular decomposition is a modular decomposition of GG with parameters (α,β)(\alpha,\beta).

NP-completeness conjecture. For every (α,β)(\alpha,\beta) with max⁡{α,β}>1\max\{\alpha,\beta\}>1, finding an (α,β)(\alpha,\beta)-modular decomposition of GG is an NP-complete problem.

The paper establishes NP-completeness of minimal modular decomposition, including the case (α,β)=(0,1)(\alpha,\beta)=(0,1), but states that this does not suffice to prove NP-hardness for simply finding an (α,β)(\alpha,\beta)-modular decomposition when max⁡{α,β}>1\max\{\alpha,\beta\}>1.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.