1 problem

0 votes0 replies0 views
Polynomial-time recognition conjecture for APUD(1,1)
APUD(1,1) recognition conjecture. Given a graph $G$ , it can be determined whether $G\in\mathrm{APUD}(1,1)$ in polynomial time.
Conjectureopencomputational-complexity intersection-graphs recognition-algorithmsarXiv posted 2 days ago

Polynomial-time recognition conjecture for APUD(1,1)