NP-completeness conjecture for APUD(k,m) recognition
Statement
For integers and , let denote the graph class consisting of intersection graphs of disks whose centers lie on parallel lines, with the relevant representation restricted by parameter .
APUD recognition conjecture. Recognition of is NP-complete.
The paper proves NP-completeness for the special case and asks whether the technique can establish NP membership for general . Thus the general recognition claim remains open in the source.
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.