TL;DR
This paper proves that recognizing point visibility graphs is an NP-hard problem by reducing 3-SAT satisfiability to the recognition problem, showing its computational complexity.
Contribution
It establishes the NP-hardness of point visibility graph recognition through a polynomial-time reduction from 3-SAT.
Findings
Recognition of point visibility graphs is NP-hard.
A polynomial-time reduction from 3-SAT to point visibility graph recognition.
The problem's computational complexity is now classified as NP-hard.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.