1 problem

NP-completeness conjecture for APUD(k,m) recognition
APUD recognition conjecture. Recognition of $\mathrm{APUD}(k,m)$ is NP-complete.
openFrom paperscomputational-complexity disk-graphs intersection-graphs
0 responses
10

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