1 problem

0 votes0 replies0 views
NP-completeness conjecture for APUD(k,m) recognition
APUD recognition conjecture. Recognition of $\mathrm{APUD}(k,m)$ is NP-complete.
Conjectureopencomputational-complexity disk-graphs intersection-graphsarXiv posted 2 days ago

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