NP-completeness conjecture for finding (\alpha,\beta)-modular decompositions
Statement
Let be a graph and let be a pair of integers with
An -modular decomposition is a modular decomposition of with parameters .
NP-completeness conjecture. For every with , finding an -modular decomposition of is an NP-complete problem.
The paper establishes NP-completeness of minimal modular decomposition, including the case , but states that this does not suffice to prove NP-hardness for simply finding an -modular decomposition when .
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.