1 problem

Matching

NP-completeness conjecture for APUD(k,m) recognition
About 5 years old
APUD recognition conjecture. Recognition of $\mathrm{APUD}(k,m)$ is NP-complete.
opencomputational-complexity disk-graphs intersection-graphs
012

NP-completeness conjecture for APUD(k,m) recognition