Polynomial-time recognition conjecture for ordered curve pseudo-visibility graphs
Statement
An ordered curve pseudo-visibility graph is the ordered graph arising from the pseudo-visibility representation by curves discussed in the paper. Recognition conjecture. Ordered curve pseudo-visibility graphs can be recognized in polynomial time. The problem is motivated by the difficulty of characterizing and recognizing point and polygon visibility graphs; the paper presents this as an open algorithmic question in the more combinatorial pseudo-visibility setting.
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.