ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For integers kk and mm, let APUD(k,m)\mathrm{APUD}(k,m) denote the graph class consisting of intersection graphs of disks whose centers lie on kk parallel lines, with the relevant representation restricted by parameter mm.

APUD recognition conjecture. Recognition of APUD(k,m)\mathrm{APUD}(k,m) is NP-complete.

The paper proves NP-completeness for the special case m=0m=0 and asks whether the technique can establish NP membership for general mm. 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 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.