Point visibility graph recognition is NP-hard
Computational Geometry
2016-05-05 v2 Computational Complexity
Discrete Mathematics
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.
Keywords
Cite
@article{arxiv.1406.2428,
title = {Point visibility graph recognition is NP-hard},
author = {Bodhayan Roy},
journal= {arXiv preprint arXiv:1406.2428},
year = {2016}
}