Point visibility graph recognition is NP-hard
classification
💻 cs.CG
cs.CCcs.DM
keywords
graphpointvisibilityformulanp-hardrecognitionconstructedestablishes
read the original abstract
Given a 3-SAT formula, a graph can be constructed in polynomial time such that the graph is a point visibility graph if and only if the 3-SAT formula is satisfiable. This reduction establishes that the problem of recognition of point visibility graphs is NP-hard.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.